#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
struct edge{ int to, cost; };
const int INF = 1001001001;
const int MAX_N = 200005;
const int MAX_V = 200005;
vector<edge> G[MAX_V];
int d[MAX_V];

void dijkstra(int s){
    // greater<P>を指定することでfirstが小さい順に取り出せるようにする
    priority_queue<P, vector<P>, greater<P> > que;
    fill(d, d+MAX_V, INF);
    d[s] = 0;
    que.push(P(0, s));

    while(!que.empty()){
        P p = que.top();
        que.pop();
        int v = p.second;
        if(p.first > d[v]) continue;
        for(int i=0; i<G[v].size(); i++){
            edge e = G[v][i];
            if(d[e.to] > d[v] + e.cost){
                d[e.to] = d[v] + e.cost;
                que.push(P(d[e.to], e.to));
            }
        }
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    int s[m], t[m], u[m];
    rep(i,m){
        cin >> s[i] >> t[i] >> u[i];
        s[i]--; t[i]--;
    }

    int l = 0, r = INF;
    int dist = 1001001;
    while(l+1 < r){
        int mid = (l+r) / 2;
        rep(i,n) G[i].clear();
        rep(i,m){
            if(mid > u[i]) continue;
            edge e1, e2;
            e1.to = t[i]; e1.cost = 1;
            e2.to = s[i]; e2.cost = 1;
            G[s[i]].push_back(e1);
            G[t[i]].push_back(e2);
        }
        dijkstra(0);
        if(d[n-1] < INF){
            r = mid;
            dist = d[n-1];
        }else{
            l = mid;
        }
    }

    cout << r << ' ' << dist << endl;
    return 0;
}