#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
template <typename _T>
inline void read(_T &f) {
  f = 0;
  _T fu = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fu = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    f = (f << 3) + (f << 1) + (c & 15);
    c = getchar();
  }
  f *= fu;
}
template <typename T>
void print(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x < 10)
    putchar(x + 48);
  else
    print(x / 10), putchar(x % 10 + 48);
}
template <typename T>
void print(T x, char t) {
  print(x);
  putchar(t);
}
template <typename T>
struct hash_map_t {
  vector<T> v, val, nxt;
  vector<int> head;
  int mod, tot, lastv;
  T lastans;
  bool have_ans;
  hash_map_t(int md = 0) {
    head.clear();
    v.clear();
    val.clear();
    nxt.clear();
    tot = 0;
    mod = md;
    nxt.resize(1);
    v.resize(1);
    val.resize(1);
    head.resize(mod);
    have_ans = 0;
  }
  void clear() { *this = hash_map_t(mod); }
  bool count(int x) {
    int u = x % mod;
    for (register int i = head[u]; i; i = nxt[i]) {
      if (v[i] == x) {
        have_ans = 1;
        lastv = x;
        lastans = val[i];
        return 1;
      }
    }
    return 0;
  }
  void ins(int x, int y) {
    int u = x % mod;
    nxt.push_back(head[u]);
    head[u] = ++tot;
    v.push_back(x);
    val.push_back(y);
  }
  int qry(int x) {
    if (have_ans && lastv == x) return lastans;
    count(x);
    return lastans;
  }
};
const int N = 1e6 + 5;
struct ele {
  int u, v, val;
  bool operator<(const ele A) const { return val < A.val; }
} a[N];
int f[N];
int n, m;
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
int main() {
  read(n);
  read(m);
  for (register int i = 1; i <= m; i++) {
    read(a[i].u);
    read(a[i].v);
    read(a[i].val);
  }
  sort(a + 2, a + m + 1);
  for (register int i = 1; i <= n; i++) f[i] = i;
  for (register int i = 2; i <= m; i++) {
    if (find(a[i].u) != find(a[i].v)) {
      f[find(a[i].u)] = find(a[i].v);
      if (find(a[1].u) == find(a[1].v)) {
        cout << a[i].val << endl;
        return 0;
      }
    }
  }
  cout << (int)1e9 << endl;
  return 0;
}
