#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
const int maxn=999999999;
int n,m;
int co[110][110];
int main()
{
	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++)
	    co[i][j]=maxn;
	for(int i=1;i<=m;i++)
	{
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		co[a][b]=c;
		co[b][a]=c;
	}
	for(int k=0;k<n;k++)
	  for(int i=0;i<n;i++)
	    for(int j=0;j<n;j++)
	      if(co[i][k]+co[k][j]<co[i][j])
	        co[i][j]=co[i][k]+co[k][j];
	int dada[n];
	memset(dada,0,n);
	for(int i=0;i<n;i++)
	  for(int j=0;j<n;j++)
	  {
	  	if(i==j)continue;
	  	dada[i]=max(dada[i],co[i][j]);
	  }
	int ans=maxn,ansi=-1;
	for(int i=0;i<n;i++)
		if(ans>dada[i])
		{
			ans=dada[i];
			ansi=i;
		}
	//for(int i=0;i<n;i++)printf("%d  ",dada[i]);
	printf("%d",ansi);
	fclose(stdin);
	fclose(stdout);
	return 0;
}