#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define maxn 20010
#define maxe 100010
using namespace std;
int n,m;
int rt[maxn];
struct Edge{
	int from,to,w;
}e[maxe];
bool cmp(const Edge&x,const Edge&y){
	return x.w>y.w;
}
int Find(int x)
{
	int o=x,temp;
	while(o!=rt[o])o=rt[o];
	while(rt[x]!=o){
		temp=rt[x];
		rt[x]=o;
		x=temp;
	}
	return o;
}
int main()
{
	freopen("prison1.in","r",stdin);
	freopen("prison1.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
		scanf("%d%d%d",&e[i].from,&e[i].to,&e[i].w);
	sort(e+1,e+1+m,cmp);
	for(int i=1;i<=n;i++)rt[i]=i;
	for(int i=1;i<=m;i++){
		int x=e[i].from,y=e[i].to;
		int rx=Find(x);
		int ry=Find(y);
		if(rx==ry){
			printf("%d\n",e[i].w);
			fclose(stdin);fclose(stdout);
			return 0;
		}
		rt[rx]=ry;
	}
	
}