#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    struct Edge {
        int u, v, w;
        bool operator<(const Edge& x) const {
            return w < x.w;
        }
    };
    vector<Edge> es(m);
    for(auto& e: es) cin >> e.u >> e.v >> e.w, e.u--, e.v--;
    sort(rall(es));
    dsu d(n);
    VVI to(n);
    int pre = -1;
    for(auto e: es) {
        if (pre != e.w && d.same(0, n - 1)) break;
        to[e.u].push_back(e.v);
        to[e.v].push_back(e.u);
        d.merge(e.u, e.v);
        pre = e.w;
    }
    cout << pre << ' ';
    VI dist(n, -1);
    queue<int> q;
    auto push = [&](int i, int c) {
        if (dist[i] == -1) {
            dist[i] = c;
            q.push(i);
        }
    };
    push(0, 0);
    while(!q.empty()) {
        int u = q.front(); q.pop();
        int nc = dist[u] + 1;
        for(int v: to[u]) push(v, nc);
    }
    cout << dist[n - 1] << '\n';
}