#include "bits/stdc++.h" //#include "atcoder/all" using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; const int INF = 1e9; const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" int n, m; struct Edge { int to, w; Edge(int to, int w) :to(to), w(w) {} }; vectorg[100005]; int f(long long x) { vectord(n, INF); queue q; q.emplace(0); d[0] = 0; while (!q.empty()) { int now = q.front(); q.pop(); for (auto e : g[now]) { if (e.w < x) { continue; } if (d[e.to] > d[now] + 1) { d[e.to] = d[now] + 1; q.emplace(e.to); } } } if (INF == d[n - 1]) { return -1; } return d[n - 1]; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; rep(i, m) { int s, t, d; cin >> s >> t >> d; s--; t--; g[s].emplace_back(t, d); g[t].emplace_back(s, d); } long long ng = INF; long long ok = 0; int ans = 0; while (1 < abs(ok - ng)) { long long c = (ng + ok) / 2; int ret = f(c); if (-1 != ret) { ok = c; ans = ret; } else { ng = c; } } cout << ok << " " << ans << endl; return 0; }