#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=1000;
int g[maxn][maxn];int n,m,x,y,d;
int dis[maxn];
inline void out(){
	for (int i=0;i<n;i++){
	   for (int j=0;j<n;j++)
	   cout << g[i][j] << " ";
	cout<<endl;
	}
	cout<<endl;
}
inline void readln(){
	freopen("djsa.in","r",stdin);
	freopen("djsa.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (int i=0;i<n;i++)
	for (int j=0;j<n;j++)
	if (i==j) g[i][j]=0;else g[i][j]=1000000;
	for (int i=1;i<=m;i++){
		scanf("%d%d%d",&x,&y,&d);
		g[x][y]=g[y][x]=d;
	}
	
	//out();
}
inline void floyd(){
	for(int k=0;k<n;k++)   
     for(int i=0;i<n;i++)   
      for(int j=0;j<n;j++)   
      if(g[i][j]>g[i][k]+g[k][j])   
      g[i][j]=g[i][k]+g[k][j]; 
    //out();
}
int Main(){
	readln();
    floyd();
	int di=1000000;int use=0;
	for (int i=0;i<n;i++){
		for (int j=0;j<n;j++){
			if (i!=j)
			dis[i]=max(dis[i],g[i][j]);
		}
	}
	for (int i=0;i<n;i++){
		//cout << dis[i] <<" ";
		if(dis[i]<di){
		use=i;di=dis[i];	
		}
	}
	printf("%d",use);
	fclose(stdin);fclose(stdout);
	return 0;
}
int main(){;}
int xlm=Main();