#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

vector<int> bfs(const vector<vector<int>> &G, int start) {
    vector<int> res(G.size(), -1);
    queue<pair<int, int> > Q;
    Q.push(make_pair(start, 0));
    while (Q.size()) {
        auto p = Q.front();
        Q.pop();
        if (res[p.first] != -1) continue;
        res[p.first] = p.second;
        for (auto v : G[p.first])
            Q.push(make_pair(v, p.second + 1));
    }
    return res;
}

void solve() {
    int N, M;
    cin >> N >> M;
    vi S(M), T(M), D(M);
    vector<vector<pii>> G(N);
    rep(i, M) {
        cin >> S[i] >> T[i] >> D[i];
        --S[i];
        --T[i];
        G[S[i]].emplace_back(T[i], D[i]);
        G[T[i]].emplace_back(S[i], D[i]);
    }

    vi X(N, -1);
    priority_queue<pii> Q;
    Q.push(mp((int)1e9, 0));
    while (!Q.empty()) {
        int w, u;
        tie(w, u) = Q.top();
        Q.pop();
        if (X[u] != -1) {
            continue;
        }
        X[u] = w;
        each(e, G[u]) {
            int v, d;
            tie(v, d) = e;
            if (X[v] == -1) {
                Q.push(mp(min(w, d), v));
            }
        }
    }

    vector<vi> H(N);
    rep(i, M) {
        if (D[i] >= X[N - 1]) {
            H[S[i]].push_back(T[i]);
            H[T[i]].push_back(S[i]);
        }
    }

    int ans = bfs(H, 0)[N-1];
    cout << X[N - 1] << ' ' << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}