#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

struct Union_Find_Tree{
    vector<int> data;
    const int n;
    
    Union_Find_Tree(int n) : data(n, -1), n(n) {}
    
    int root(int x){
        if(data[x] < 0) return x;
        return data[x] = root(data[x]);
    }

    int operator [] (int i) {return root(i);}
    
    bool unite(int x, int y){
        x = root(x), y = root(y);
        if(x == y) return false;
        if(data[x] > data[y]) swap(x, y);
        data[x] += data[y], data[y] = x;
        return true;
    }
    
    int size(int x) {return -data[root(x)];}
    
    bool same(int x, int y) {return root(x) == root(y);}
    
    void clear() {fill(begin(data), end(data), -1);}
};

template<bool directed = false>
struct Graph{
    struct edge{
        int to, id;
        edge(int to, int id) : to(to), id(id) {}
    };

    vector<vector<edge>> es;
    const int n;
    int m;

    Graph(int n) : es(n), n(n), m(0) {}

    void add_edge(int from, int to){
        es[from].emplace_back(to, m);
        if(!directed) es[to].emplace_back(from, m);
        m++;
    }

    int bfs(int s, int t){
        queue<int> que;
        vector<int> d(n, inf);
        que.emplace(s), d[s] = 0;

        while(!que.empty()){
            int i = que.front(); que.pop();
            each(e, es[i]){
                if(chmin(d[e.to], d[i]+1)){
                    que.emplace(e.to);
                }
            }
        }

        return d[t];
    }
};

int main(){
    int N, M; cin >> N >> M;

    vector<int> u(M), v(M), d(M);
    rep(i, M){
        cin >> u[i] >> v[i] >> d[i]; u[i]--, v[i]--;
    }

    int l = 0, r = inf; //[l,r)

    while(r-l > 1){
        int m = (l+r)/2;

        Union_Find_Tree uf(N);

        rep(i, M){
            if(d[i] >= m) uf.unite(u[i], v[i]);
        }

        if(uf.same(0, N-1)) l = m;
        else r = m;
    }

    cout << l << ' ';
    Graph G(N);

    rep(i, M){
        if(d[i] >= l){
            G.add_edge(u[i], v[i]);
        }
    }

    cout << G.bfs(0, N-1) << '\n';
}