#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	vector<vector<pii>> g(N);
	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);
	}
	
	vector<int> dist(N, -INF);
	priority_queue<pii, vector<pii>, greater<pii>> pq;
	dist[0] = INF;
	pq.emplace(INF, 0);
	while (!pq.empty()) {
		auto [d, u] = pq.top(); pq.pop();
		if (dist[u] != d) continue;
		for (auto [v, dis] : g[u]) if (chmax(dist[v], min(d, dis))) pq.emplace(dist[v], v);
	}
	
	int mx = dist[N - 1];
	
	dist.assign(N, INF);
	queue<int> que;
	dist[0] = 0;
	que.emplace(0);
	while (!que.empty()) {
		int u = que.front(); que.pop();
		for (auto [v, dis] : g[u]) if (dis >= mx && chmin(dist[v], dist[u] + 1)) que.emplace(v);
	}
	
	cout << mx << " " << dist[N - 1] << endl;
}