#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;

struct edge{
    int to, li;
};

vector<vector<edge>> G(100010);

ll BFS(ll w, int n){
    vector<ll> d(n, inf);
    d[0] = 0;
    queue<ll> que;
    que.push(0);
    while(!que.empty()){
        ll v = que.front();
        que.pop();
        for(auto nv : G[v]){
            if(nv.li < w)continue;
            if(chmin(d[nv.to], d[v]+1))que.push(nv.to);
        }
    }
    return d[n-1];
}
int main() {
    int n, m;
    cin >> n >> m;
    rep(i, m){
        int s, t, d;
        cin >> s >> t >> d;
        s--; t--;
        G[s].push_back({t, d});
        G[t].push_back({s, d});
    }
    ll ok = 0, ng = mod;
    while(ng - ok > 1){
        ll mid = (ng + ok) / 2;
        if(BFS(mid, n) != inf)ok = mid;
        else ng = mid;
    }
    cout << ok << " "<< BFS(ok, n) << endl;
}