#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<int, pair<int, int>> &p1,
                  const pair<int, pair<int, int>> &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 1e5 + 5, inf = 2e18;
class DSU {
  int parent[N];
  long long int si[N];

 public:
  void make_set(int v) {
    parent[v] = v;
    si[v] = 1;
  }
  int find_set(int x) {
    if (parent[x] == x) return x;
    return parent[x] = find_set(parent[x]);
  }
  void union_sets(int a, int b) {
    int x = find_set(a);
    int y = find_set(b);
    if (x != y) {
      if (si[x] < si[y]) swap(x, y);
      parent[y] = x;
      si[x] += si[y];
    }
  }
  long long int get_size(int v) { return si[find_set(v)]; }
};
long long int n, m, a, b;
set<pair<long long int, pair<long long int, long long int>>> s;
bool check(long long int v) {
  DSU dsu;
  for (long long int i = (long long int)0; i < (long long int)(n); i++)
    dsu.make_set(i);
  if (s.empty()) return 1;
  int f = 0;
  for (auto p : s) {
    if (p.first >= v && f == 0) {
      if (dsu.find_set(a) != dsu.find_set(b)) {
        return 1;
      }
      f = 1;
    }
    if (dsu.find_set(p.second.first) != dsu.find_set(p.second.second)) {
      if (p.second.first == a && p.second.second == b) return 1;
      dsu.union_sets(p.second.first, p.second.second);
    }
  }
  if (f == 0) {
    if (dsu.find_set(a) != dsu.find_set(b)) {
      return 1;
    }
  }
  return 0;
}
void solve() {
  cin >> n >> m;
  long long int x, y, e, w;
  cin >> a >> b >> e;
  a--;
  b--;
  for (long long int i = (long long int)0; i < (long long int)(m - 1); i++) {
    cin >> x >> y >> w;
    x--;
    y--;
    s.insert({w, {x, y}});
  }
  long long int lo = 0, hi = 1e9 + 1;
  while (lo + 1 < hi) {
    long long int m = (lo + hi) >> 1;
    if (check(m))
      lo = m;
    else
      hi = m;
  }
  cout << lo << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
