#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
struct unionfind{
    vector<int> par, sz;
    unionfind() {}
    unionfind(int n):par(n), sz(n, 1){
        for(int i=0; i<n; i++) par[i]=i;
    }
    int find(int x){
        if(par[x]==x) return x;
        return par[x]=find(par[x]);
    }
    void unite(int x, int y){
        x=find(x); y=find(y);
        if(x==y) return;
        if(sz[x]>sz[y]) swap(x, y);
        par[x]=y;
        sz[y]+=sz[x];
    }
    bool same(int x, int y){
        return find(x)==find(y);
    }
    int size(int x){
        return sz[find(x)];
    }
};
int main()
{
    int n; cin>>n;
    int m; cin>>m;
    int a[100010], b[100010], d[100010];
    for(int i=0; i<m; i++){
        cin>>a[i]>>b[i]>>d[i];
        a[i]--; b[i]--;
    }
    int l=0, r=1e9;
    while(r-l>1){
        int mid=(l+r)/2;
        unionfind uf(n);
        for(int i=0; i<m; i++){
            if(d[i]>=mid) uf.unite(a[i], b[i]); 
        }
        if(uf.same(0, n-1)) l=mid;
        else r=mid;
    }
    cout<<l<<" ";
    int e[100010];
    const int INF=1e9;
    fill(e, e+n, INF);
    e[0]=0;
    queue<int> que; que.push(0);
    vector<int> g[100010];
    for(int i=0; i<m; i++){
        if(d[i]>=l){
            g[a[i]].push_back(b[i]);
            g[b[i]].push_back(a[i]);
        }
    }
    while(!que.empty()){
        int x=que.front(); que.pop();
        for(auto y:g[x]){
            if(e[y]>e[x]+1){
                e[y]=e[x]+1;
                que.push(y);
            }
        }
    }
    cout<<e[n-1]<<endl;
    return 0;
}