#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<map>

 #include<ctime>

 #include<vector>

 #include<set>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 const int maxn=;

 struct node{

     int x,y,v;

     bool operator<(const node& b)const{return v>b.v;}

 }e[];

 int f[maxn<<],n,m;

 void init(){

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

     for(int i=;i<=m;i++)scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].v);

     sort(e+,e+m+);

 }

 void print(int x){cout<<x<<endl;exit();}

 int getfather(int x){return f[x]==x?x:f[x]=getfather(f[x]);}

 void work(){

     for(int i=;i<=(n<<);i++)f[i]=i;

     int x,y;

     for(int i=;i<=m;i++){

         x=getfather(e[i].x);y=getfather(e[i].y);

         if(x==y)print(e[i].v);

         else {f[x]=getfather(e[i].y+n),f[y]=getfather(e[i].x+n);}

     }

     print();

 }

 int main(){

     init();

     work();

 }