#line 1 "/workspaces/compro/lib/template.hpp"

#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>

#ifndef IO_VECTOR
#define IO_VECTOR

template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
  int size = v.size();
  for (int i = 0; i < size; i++) {
    std::cout << v[i];
    if (i != size - 1)
      std::cout << " ";
  }
  return out;
}

template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
  for (auto &el : v) {
    std::cin >> el;
  }
  return in;
}

#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<

using namespace std;

template <class T> void chmin(T &a, T b) {
  if (a > b)
    a = b;
}

template <class T> void chmax(T &a, T b) {
  if (a < b)
    a = b;
}

// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
}

#line 2 "main.cpp"

std::pair<long long, long long> solve(long long n, int m, const std::vector<long long> &s,
                                      const std::vector<long long> &t, const std::vector<long long> &d) {
  ll ng = 0;
  REP(i, m) { chmax(ng, d[i] + 1); }

  ll ok = 0;

  auto f = [&](ll x) {
    vector<vector<int>> g(n);
    REP(i, m) {
      if (x > d[i])
        continue;
      g[s[i]].push_back(t[i]);
      g[t[i]].push_back(s[i]);
    }

    queue<pair<int, int>> q;
    q.push({0, 0});
    vector<bool> reached(n, false);
    while (!q.empty()) {
      auto [v, num] = q.front();
      q.pop();
      if (reached[v])
        continue;
      if (v == n - 1)
        return num;
      reached[v] = true;
      for (const auto &u : g[v]) {
        if (reached[u])
          continue;
        q.push({u, num + 1});
      }
    }
    return -1;
  };

  while (abs(ok - ng) > 1) {
    ll mid = (ok + ng) / 2;
    if (f(mid) != -1) {
      ok = mid;
    } else {
      ng = mid;
    }
  }

  return {ok, f(ok)};
}

// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
  int n;
  int m;
  std::cin >> n >> m;
  std::vector<long long> s(m), t(m), d(m);
  for (int i = 0; i < m; ++i) {
    std::cin >> s[i] >> t[i] >> d[i];
    s[i]--;
    t[i]--;
  }
  auto [c, e] = solve(n, m, s, t, d);
  std::cout << c << ' ' << e << std::endl;
  return 0;
}