#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int main() {
  int n, m; cin >> n >> m;
  vector<tuple<int, int, int>> edge(m);
  for (int i = 0; i < m; i++) {
    cin >> get<0>(edge[i]) >> get<1>(edge[i]) >> get<2>(edge[i]);
  }
  sort(edge.begin(), edge.end(), [&](auto a, auto b) {
    return get<2>(a) > get<2>(b);
  });
  int w = 0;
  dsu uf(n);
  for (int i = 0; i < m; i++) {
    auto [s, t, d] = edge[i];
    s--, t--;
    uf.merge(s, t);
    if (uf.same(0, n - 1)) {
      w = d;
      break;
    }
  }
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    auto [s, t, d] = edge[i];
    s--, t--;
    if (w <= d) {
      g[s].push_back(t);
      g[t].push_back(s);
    }
  }
  vector<ll> dist(n, 1e18);
  vector<bool> vis(n, false);
  dist[0] = 0;
  vis[0] = true;
  queue<int> que;
  que.push(0);
  while (!que.empty()) {
    int u = que.front(); que.pop();
    for (int v: g[u]) {
      if (vis[v]) continue;
      if (dist[v] > dist[u] + 1) {
        vis[v] = true;
        dist[v] = dist[u] + 1;
        que.push(v);
      }
    }
  }
  cout << w << ' ' << dist[n - 1] << endl;
  return 0;
}