#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back

const int MAXN = 100010;
const int INF = 1e9 + 1;

struct dsu {
    int n;
    vector<int> par, siz, isb, moment;
    vector<vector<int>> sub;
    vector<pair<int, int>> bamboo;
    dsu() = default;
    dsu(int n_) {
        n = n_;
        par.assign(n, 0);
        siz.assign(n, 1);
        moment.assign(n, INF);
        isb.assign(n, 1);
        sub.resize(n);
        for (int i = 0; i < n; i++) {
            sub[i].pb(i);
            bamboo.pb({i, i}); 
        }
        iota(all(par), 0);
    }
    int get(int v) {return (par[v] == v ? v : par[v] = get(par[v]));}
    bool merge(int u, int v, int W) {
        int oru = u, orv = v;
        u = get(u); v = get(v); 
        if (u == v) {
            if (isb[u]) {
                isb[u] = 0;
                for (int U : sub[u]) {
                    moment[U] = W;
                }
            }
            return false;
        }
        bool new_not_bamboo = (!isb[u] || !isb[v] || (oru != bamboo[u].first && oru != bamboo[u].second) || (orv != bamboo[v].first && orv != bamboo[v].second));
        if (new_not_bamboo && isb[u]) {
            for (int U : sub[u]) moment[U] = W;
        }
        if (new_not_bamboo && isb[v]) {
            for (int U : sub[v]) moment[U] = W;
        }
        if (siz[u] < siz[v]) swap(u, v);
        par[v] = u;
        siz[u] += siz[v];
        for (auto &U : sub[v]) {
            sub[u].pb(U);
        }
        sub[v].clear();
        isb[u] = !new_not_bamboo;
        if (isb[u]) {
            map<int, int> cnt;
            cnt[bamboo[u].first]++;cnt[bamboo[u].second]++;
            cnt[bamboo[v].first]++;cnt[bamboo[v].second]++;
            set<int> st;
            vector<int> xd = {u, v};
            for (int vt : xd) {
                if(cnt[bamboo[vt].first] - (bamboo[vt].first == oru) - (bamboo[vt].first == orv) == 1) st.insert(bamboo[vt].first);
                if(cnt[bamboo[vt].second] - (bamboo[vt].second == oru) - (bamboo[vt].second == orv) == 1) st.insert(bamboo[vt].second);
            }
            bamboo[u] = {*st.begin(), *st.rbegin()};
        }
        return true;
    }
};

vector<int> gt[MAXN];
int up[17][MAXN], h[MAXN], tin[MAXN], tout[MAXN], tim = 0;
// up2 for bridges, up3 for some edge out

void dfs(int v, int p) {
    tin[v] = tim++;
    up[0][v] = p;
    for (int i = 1; i < 17; i++) {
        up[i][v] = up[i - 1][up[i - 1][v]];
    }
    for (int u : gt[v]) {
        if (u != p) {
            h[u] = h[v] + 1;
            dfs(u, v);
        }
    }
    tout[v] = tim++;
}

bool par(int u, int v) {
    return tin[u] <= tin[v] && tout[v] <= tout[u];
}

int lca(int u, int v) {
    if (par(u, v)) return u;
    if (par(v, u)) return v;
    for (int i = 16; i >= 0; i--) {
        if (!par(up[i][v], u)) v = up[i][v];
    }
    return up[0][v];
}

int dist(int u, int v) {return h[u] + h[v] - 2 * h[lca(u, v)];}

vector<pair<int, int>> gtt[MAXN];
int up101[17][MAXN];

void dfs2(int v, int p, int inw) {
    up101[0][v] = inw;
    for (int i = 1; i < 17; i++) {
      up101[i][v] = max(up101[i - 1][v], up101[i - 1][up[i - 1][v]]);
    }
    for (auto &[u, w] : gtt[v]) {
        if (u != p) {
            dfs2(u, v, w);
        }
    }
}

vector<int> FUCKFUCK;
int get_maxw_on_path(int u, int v) {
  int lc = lca(u, v);
  int ans = 0;
  for (int i = 0; i < 17; i++) {
    if (((h[u] - h[lc]) >> i) & 1) {
      ans = max(ans, up101[i][u]);
      u = up[i][u];
    }
  }
  for (int i = 0; i < 17; i++) {
    if (((h[v] - h[lc]) >> i) & 1) {
      ans = max(ans, up101[i][v]);
      v = up[i][v];
    }
  }
  return ans;
}

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    vector<int> ord(M);
    iota(all(ord), 0);
    sort(all(ord), [&](int i, int j){
        return W[i] < W[j];
    });
    dsu d(N);
    vector<int> ev;
    for (int i = 0; i < M; i++) {
        if (d.merge(U[ord[i]], V[ord[i]], W[ord[i]])) {
            gtt[U[ord[i]]].pb({V[ord[i]], W[ord[i]]});
            gtt[V[ord[i]]].pb({U[ord[i]], W[ord[i]]});
        }
    }
    FUCKFUCK = d.moment;
    dfs(0, 0);
    dfs2(0, 0, 0);
}

int getMinimumFuelCapacity(int X, int Y) {
    int A1 = max(FUCKFUCK[X], FUCKFUCK[Y]);
    int A3 = get_maxw_on_path(X, Y);
    if(max(A1, A3) == 588185226) assert(A3 == 588185226);
    return (max(A1, A3) == INF ? -1 : max(A1, A3));
}