#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<stack>
#include<queue>
#include<map>
#include<vector>
#include<cstdio>
#include<set>
#include<bitset>
#include<iomanip>
#define int long long
using namespace std;
int n,m;
const int N=1e6+5;
const int inf=1145141919810;
struct node{
	int v,w;
};
vector<node>e[N]; 
int maxn[N],maxn1[N],vis[N];
int ans=inf;
inline void dij(int s)
{
	queue<int>q;
	for(int i=1;i<=n;i++) vis[i]=0,maxn[i]=0,maxn1[i]=0;
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		if(vis[u]) continue;
		vis[u]=1;
		for(auto i:e[u])
		{
			int v=i.v,w=i.w;
			if(w>maxn[u])
			{
				maxn[v]=w;
				maxn1[v]=maxn[u];
			}
			else if(w==maxn[u])
			{
				maxn[v]=maxn[u];
				maxn1[v]=maxn[u];
			}
			else if(w<maxn[u])
			{
				if(w>=maxn1[u])
				{
					maxn[v]=maxn[u];
					maxn1[v]=w;
				}
				else 
				{
					maxn[v]=maxn[u];
					maxn1[v]=maxn1[u];
				}
			}
			if(v==n) 
			{
				ans=min(ans,maxn[n]+maxn1[n]);
				cout<<maxn[v]<<' '<<maxn1[v]<<'\n';
			}
			q.push(v);
		}
	}
}
signed main()
{
//	freopen("takeout2.in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
		e[u].push_back({v,w});
		e[v].push_back({u,w});
	}
	dij(1);
	cout<<ans;
 	return 0;
}