#include <bits/stdc++.h>

using namespace std;

const int maxn = ;

struct edge {

    int u, v, w;

}edg[maxn];

int n, m, p[maxn], ans = ;

bool cmp(edge a, edge b)

    {return a.w < b.w;}

int findp(int t)

    {return p[t] ? p[t] = findp(p[t]) : t;}

bool merge(int u, int v)

{

    u = findp(u); v = findp(v);

    if (u == v) return false;

    p[u] = v; return true;

}

int main()

{

    cin >> n >> m;

    for (int i = , u, v, w; i <= m; i++)

        cin >> u >> v >> w, edg[i] = (edge){u, v, w};

    sort(edg + , edg + m + , cmp);

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

        if (merge(edg[i].u, edg[i].v))

            ans = max(ans, edg[i]. w);

    cout << ans << endl;

}