#include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
int n,m,u,v,w,head[200001],dis[200001],pos,maxsize,minn=1e18,maxn;
struct edge
{
    int u,v,w,next;
}e[200001];
void addedge(int u,int v,int w)
{
    e[++pos]={u,v,w,head[u]};
    head[u]=pos;
}
int dijstra(int s)
{
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
    memset(dis,0x3f,sizeof(dis));
    dis[s]=0;
    q.push({0,s});
    while(!q.empty())
    {
        int u=q.top().second;
        q.pop();
        for(int i=head[u];i;i=e[i].next)
        {
            int v=e[i].v;
            if(dis[v]>dis[u]+1)
            {
                dis[v]=dis[u]+1;
                q.push({dis[v],v});
            }
        }
    }
    return dis[n];
}
struct node
{
    int x,maxn,minn,step,fa;
};
void bfs(int s)
{
    queue<node>q;
    q.push({s,0,1000000000000000000ll,0});
    while(!q.empty())
    {
        node u=q.front();
        q.pop();
        if(u.step==maxsize)
        {
            if(u.x==n)
            {
                minn=min(minn,u.minn);
                maxn=max(maxn,u.maxn);
                return;
            }
            continue;
        }
        for(int i=head[u.x];i;i=e[i].next)
        {
            if(i!=u.fa)
                q.push({e[i].v,max(u.maxn,e[i].w),min(u.minn,e[i].w),u.step+1,u.x});
        }
    }
}
signed main()
{
    scanf("%lld%lld",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%lld%lld%lld",&u,&v,&w);
        addedge(u,v,w);
        addedge(v,u,w);
    }
    maxsize=dijstra(1);
    bfs(1);
    //cout<<maxn<<' '<<minn<<endl;
    printf("%lld %lld",maxsize,maxn-minn);
    return 0;
}