#include<iostream>

 #include<vector>

 #include<queue>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<set>

 #include<map>

 #include<cmath>

 using namespace std;

 typedef pair<int, int> Pair;

 typedef long long ll;

 const int INF = 0x3f3f3f3f;

 int T, n, m;

 const int maxn = 2e4 + ;

 struct edge

 {

     int v, u, w;

     bool operator < (const edge a)const

     {

         return w < a.w;

     }

 };

 edge e[maxn];

 int pa[maxn];

 int Find(int x)

 {

     return x == pa[x] ? x : pa[x] = Find(pa[x]);//路径压缩

 }

 void kruskal()

 {

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

     sort(e, e + m);

     int ans = ;

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

     {

         int v = e[i].v, u = e[i].u, w = e[i].w;

         int x = Find(v), y = Find(u);

         if(x != y)

         {

             pa[x] = y;

             ans = max(ans, w);

         }

     }

     cout<<ans<<endl;

 }

 int main()

 {

     cin >> n >> m;

     for(int i = ; i < m; i++)cin >> e[i].v >> e[i].u >> e[i].w;

     kruskal();

 }