#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=101;
const int INF=20010318;
int n,m,ans=INF,ans1,ans2;
int a[maxn][maxn],b[maxn];
inline void read()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
		{
			a[i][j]=INF;
			a[i][i]=0;
		}
	for(int i=1;i<=m;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		a[x][y]=z;
		a[y][x]=z;
	}
	for(int k=0;k<n;k++)
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
			{
				a[i][j]=min(a[i][k]+a[k][j],a[i][j]);
			}
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			int now=0;
			for(int k=0;k<n;k++){
				now=max(now,min(a[i][k],a[j][k]));
			}
			if(ans>now){
				ans=now;
				ans1=i,ans2=j;
			}
		}
	}
	printf("%d %d",ans1,ans2);
}
int main()
{
	freopen("djsb.in","r",stdin);
	freopen("djsb.out","w",stdout);
	read();
	return 0;
}