#include<cstdio>
#include<algorithm>
#define maxn 100010

using namespace std;

int n,m,cnt;
int fa[maxn],emy[maxn];

struct node{int x,y,w;bool operator <(const node &a)const{return w>a.w;}}a[maxn];

int get(int x){return fa[x]==x?x:fa[x]=get(fa[x]);}
void add(int x,int y){fa[get(x)]=get(y);}
bool check(int x,int y){return get(x)==get(y);}

int main(){
	freopen("prison1.in","r",stdin);
	freopen("prison1.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1;i<=m;i++)scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].w);
	sort(a+1,a+m+1);
	for(int i=1;i<=m;i++){
		if(check(a[i].x,a[i].y)){
			printf("%d",a[i].w);return 0; 
		}
		else{
			if(!emy[a[i].x])emy[a[i].x]=a[i].y;
			else add(emy[a[i].x],a[i].y); //敌人的敌人就是朋友 
			if(!emy[a[i].y])emy[a[i].y]=a[i].x;
			else add(emy[a[i].y],a[i].x);
		}
	}
	printf("0");
	return 0;
}