#include <bits/stdc++.h>
using namespace std;

using P = pair<int, int>;

int n, m;
vector<vector<P>> g;

int solve(int lim);

int main() {
  cin >> n >> m;
  g.resize(n);
  for (int i = 0; i < m; ++i) {
    int a, b, c;
    cin >> a >> b >> c;
    g[--a].emplace_back(--b, c);
    g[b].emplace_back(a, c);
  }
  int l = 0, r = 1e9 + 1;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (solve(mid) < 0)
      r = mid;
    else
      l = mid;
  }
  cout << l << " " << solve(l) << endl;
  return 0;
}

int solve(int lim) {
  vector<int> dist(n, n + 1);
  queue<int> qu;
  dist[0] = 0;
  qu.push(0);
  while (qu.size()) {
    int now = qu.front();
    qu.pop();
    for (auto [to, x] : g[now])
      if (x >= lim && dist[to] > dist[now] + 1) {
        dist[to] = dist[now] + 1;
        qu.push(to);
      }
  }
  if (dist[n - 1] == n + 1) return -1;
  return dist[n - 1];
}