#include <bits/stdc++.h>
#define int long long
#define N 2000005
using namespace std;
struct prisoner
{
    int x, y, z;
} p[N];
int fa[N];
int get(int x)
{
    if (fa[x] == x)
        return x;
    return fa[x] = get(fa[x]);
}
void merge(int x, int y)
{
    int fx = get(x), fy = get(y);
    if (fx == fy)
        return;
    fa[fx] = fy;
}
bool query(int x, int y)
{
    if (get(x) == get(y))
        return 1;
    return 0;
}
bool cmp(prisoner a, prisoner b)
{
    return a.z < b.z;
}
int n, m;
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        fa[i] = i;
    for (int i = 1; i <= m; ++i)
        cin >> p[i].x >> p[i].y >> p[i].z;
    sort(p + 1, p + n + 1, cmp);
    reverse(p + 1, p + n + 1);
    for (int i = 1; i <= m + 1; ++i)
    {
        if (query(p[i].x, p[i].y))
        {
            cout << p[i].z << '\n';
            return 0;
        }
        merge(p[i].x, p[i].y + n);
        merge(p[i].x + n, p[i].y);
    }
    return 0;
}