#include <stdio.h>

#define N 120
#define INF 99999999

int main()
{
	int n, m, i, j, k, e[N][N], min = INF, ans;
	freopen("djsa.in", "r", stdin);
	freopen("djsa.out", "w", stdout);

	scanf("%d%d", &n, &m);

	for(i = 0; i < N; i++)
	{
		for(k = 0; k < N; k++)
		{
			if(i == k)
			{
				e[i][k] = 0;
				continue;
			}
			e[i][k] = INF;
		}
	}
	for(i = 0; i < m; i++)
	{
		int x, y, z;

		scanf("%d%d%d", &x, &y, &z);

		e[x][y] = z;
		e[y][x] = z;
	}
	for(k = 0; k < n; k++)
	{
		for(i = 0; i < n; i++)
		{
			for(j = 0; j < n; j++)
			{
				if(e[i][k] + e[k][j] < e[i][j])
				{
					e[i][j] = e[i][k] + e[k][j];
				}
			}
		}
	}
	for(i = 0; i < n; i++)
	{
		int maxs = 0;
		for(k = 0; k < n; k++)
		{
			if(e[k][i] > maxs)
			{
				maxs = e[k][i];
			}
		}
		if(maxs < min)
		{
			min = maxs;
			ans = i;
		}
	}

	printf("%d\n", ans);

	fclose(stdin);
	fclose(stdout);
	return 0;
}