#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

struct edge{
	int u, v, c;
};

int N, M, DIS, ans = 0;
edge Edge[200005];
vector<edge> E[100005];
int dis[100005];
bool vis[100005];
int minn[100005];
int remdis[2][100005], remminn[2][100005];

void dijkstra(int st){
	memset(vis, 0, sizeof(vis));
	memset(dis, 0x3f, sizeof(dis));
	memset(minn, 0x3f, sizeof(minn));
	dis[st] = 0;
	priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q;
	q.push({0, st});
	while (!q.empty()){
		int u = q.top().second;
		q.pop();
		if (vis[u]) continue;
		// cout << u << " " << dis[u] << " " << minn[u] << ";;\n";
		vis[u] = 1;
		for (auto && i : E[u]){
			int v = i.v, c = i.c;
			if (dis[u] + 1 > dis[v]) continue;
			if (dis[u] + 1 == dis[v]){
				minn[v] = min(minn[v], min(minn[u], c));
			}else{
				minn[v] = min(minn[u], c);
			}
			dis[v] = dis[u] + 1;
			q.push({dis[v], v});
		}
	}
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d %d", &N, &M);
	for (int i = 0; i < M; i ++){
		scanf("%d %d %d", &Edge[i].u, &Edge[i].v, &Edge[i].c);
		E[Edge[i].u].push_back({Edge[i].u, Edge[i].v, Edge[i].c});
		E[Edge[i].v].push_back({Edge[i].v, Edge[i].u, Edge[i].c});
	}
	dijkstra(1);
	DIS = dis[N];
	printf("%d ", DIS);
	for (int i = 1; i <= N; i ++) remdis[0][i] = dis[i];
	for (int i = 1; i <= N; i ++) remminn[0][i] = minn[i];
	dijkstra(N);
	for (int i = 1; i <= N; i ++) remdis[1][i] = dis[i];
	for (int i = 1; i <= N; i ++) remminn[1][i] = minn[i];
	for (int i = 0; i < M; i ++){
		int u = Edge[i].u, v = Edge[i].v, c = Edge[i].c; //  c -> maxn
		// cout << u << " " << v << " " << c << ";;\n";
		if (remdis[0][u] + 1 + remdis[1][v] == DIS){
			int pathminn = min(remminn[0][u], remminn[1][v]);
			ans = max(ans, c - pathminn);
		}
		swap(u, v);
		if (remdis[0][u] + 1 + remdis[1][v] == DIS){
			int pathminn = min(remminn[0][u], remminn[1][v]);
			ans = max(ans, c - pathminn);
		}
	}
	printf("%d\n", ans);
	

	return 0;
}