#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=int;
using ld=long double;
ld pie=3.14159265359;
ll inf=1000000001;
ll mod=1000000007;
int main(){
    ll n,m;
    cin >> n >> m;
    vector<vector<pair<ll,ll>>>g(n);
    for (ll i = 0; i < m; i++)
    {
        ll s,t,d;
        cin >> s >> t >> d;
        s--,t--;
        g[s].push_back({t,d});
        g[t].push_back({s,d});
    }
    vector<ll>memo(n,inf);
    memo[0]=0;
    priority_queue<pair<ll,ll>>que;
    vector<ll>memo2(n,0);
    que.push({inf,0});
    memo2[0]=inf;
    while (!que.empty())
    {
        ll v=que.top().second;
        que.pop();
        for (ll i = 0; i < g[v].size(); i++)
        {
            if (memo2[g[v][i].first]<min(memo2[v],g[v][i].second))
            {
                memo2[g[v][i].first]=min(memo2[v],g[v][i].second);
                que.push({memo[g[v][i].first],g[v][i].first});
            }
        }
    }
    queue<ll>que2;
    que2.push(0);
    while (!que2.empty())
    {
        ll v=que2.front();
        que2.pop();
        for (ll i = 0; i < g[v].size(); i++)
        {
            if (memo[g[v][i].first]>memo[v]+1&&g[v][i].second>=memo2[n-1])
            {
                memo[g[v][i].first]=memo[v]+1;
                que2.push(g[v][i].first);
            }
        }
    }
    cout << memo2[n-1] << ' '<< memo[n-1] << endl;
}