#include<bits/stdc++.h>
using namespace std;
inline int read(){
    char ch=getchar();
    int x=0,f=1;
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=getchar();
    return x*f;
}
int n,m,fa[20005],b[100005];
struct qwq
{
	int x,y,w;
}a[100005];
int getf(int x)
{
	if(fa[x]==x)return x;
    fa[x]=getf(fa[x]);
	return fa[x];
}
bool judge(int x,int y)
{
	if(getf(x)==getf(y))return true;
	else return false;
}
bool cmp(qwq a,qwq b)
{
	return a.w>b.w; 
}
int add(int x,int y)
{
	x=getf(fa[x]);
	fa[x]=getf(fa[y]);
}
int main()
{
	freopen("prison1.in","r",stdin);
	freopen("prison1.out","w",stdout);
	n=read(),m=read();
	for(int i=1;i<=m;i++)a[i].x=read(),a[i].y=read(),a[i].w=read();
	for(int i=1;i<=n;i++)fa[i]=i;
	sort(a+1,a+m+1,cmp);
	for(int i=1;i<=m+1;i++)
	{
		if(judge(a[i].x,a[i].y))
		{
			cout<<a[i].w<<' ';
			break;
		}
		else 
		{
			if(!b[a[i].x])b[a[i].x]=a[i].y;
			else add(b[a[i].x],a[i].y);
			if(!b[a[i].y])b[a[i].y]=a[i].x;
			else add(b[a[i].y],a[i].x);
		}
	}
	return 0;
}