#include<bits/stdc++.h>
using namespace std;

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
const ll INF=1ll<<60;
using P = pair<ll,ll>;

int main(){
    ll N,M;
    cin>>N>>M;
    vector<vector<P>> ab(N);
    for(int i=0;i<M;i++){
        ll a,b,c;
        cin>>a>>b>>c;
        a--;b--;
        ab[a].push_back({c,b});
        ab[b].push_back({c,a});
    }
    ll l=0,r=1e16;
    while(r-l>1){
        ll m=(r+l)/2;
        vector<ll> dist(N,INF);
        priority_queue<P,vector<P>,greater<P>> q;
        q.push({0,0});
        dist[0]=0;
        while(!q.empty()){
            auto x=q.top();q.pop();
            ll cost=x.first,now=x.second;
            if(dist[now]<cost)continue;
            for(auto x2:ab[now]){
                ll tcost=x2.first,to=x2.second;
                if(tcost<m)continue;
                if(dist[to]<=dist[now]+1)continue;
                dist[to]=dist[now]+1;
                q.push({dist[to],to});
            }
        }
        if(dist[N-1]!=INF) l=m;
        else r=m;
    }
    ll m=l;
    vector<ll> dist(N,INF);
    priority_queue<P,vector<P>,greater<P>> q;
    q.push({0,0});
    dist[0]=0;
    while(!q.empty()){
        auto x=q.top();q.pop();
        ll cost=x.first,now=x.second;
        if(dist[now]<cost)continue;
        for(auto x2:ab[now]){
            ll tcost=x2.first,to=x2.second;
            if(tcost<m)continue;
            if(dist[to]<=dist[now]+1)continue;
            dist[to]=dist[now]+1;
            q.push({dist[to],to});
        }
    }
    cout << l<<" "<<dist[N-1]<< endl;
}