#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using P = pair<int, int>;
constexpr int INF = 1001001001;

int isReachable(const vector<vector<P>> &G, int obakeW){
    vector<int> dist(G.size(), INF);
    queue<int> Q;
    Q.push(0);
    dist[0] = 0;
    while(Q.size()){
        int cur = Q.front(); Q.pop();
        for(auto &p: G[cur]){
            if(p.second >= obakeW && dist[p.first] == INF){
                dist[p.first] = dist[cur]+1;
                Q.push(p.first);
            }
        }
    }
    //cerr << limWeight << " " << dist[0] << " " << dist[1] << " " << dist[2] << endl;
    return dist[G.size()-1];
}

int main(){
    int n, m;
    cin >> n >> m;

    vector<vector<P>> G(n);
    for(int i = 0; i < m; i++){
        int s, t, d;
        cin >> s >> t >> d;
        s--; t--;
        G[s].push_back(make_pair(t, d));
        G[t].push_back(make_pair(s, d));
    }

    int ac = 0;
    int wa = INF;
    while(wa-ac > 1){
        int mid = (wa+ac)/2;
        int res = isReachable(G, mid);
        if(res == INF) wa = mid;
        else ac = mid;
    }

    cout << ac << " " << isReachable(G, ac) << endl;
    return 0;
}