#include "swap.h"
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;
#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()
cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;
template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;
cl NX = 2e5 + 7, lg = 18;
ll n, m, par [NX], id [NX], deg [NX], cost [NX], anc [NX][lg], h [NX];
vector <ll> adj [NX];
bool ok [NX];
ll root (cl &v) { return ~par[v] ? par[v] = root(par[v]) : v; }
inline void unite (cl &v, cl &u, cl &w) {
ll _v = root(v), _u = root(u);
if (_v != _u) {
par[_v] = par[_u] = n;
adj[n].push_back(_v);
adj[n].push_back(_u);
deg[v]++; deg[u]++;
ok[n] = ok[_v] || ok[_u] || (max(deg[v], deg[u]) > 2);
cost[n] = w;
n++;
} else if (!ok[_v]) {
deg[v]++; deg[u]++;
ok[_v] = 1, cost[_v] = w;
}
}
void DFS (cl &v = n, cl &pr = n) {
h[v] = h[pr] + 1;
anc[v][0] = pr;
par[v] = v;
for (ll i = 1; i < lg; i++) anc[v][i] = anc[anc[v][i - 1]][i - 1];
for (auto &u : adj[v]) if (u != pr) DFS(u, v);
}
inline ll up (ll v, cl &d) { for (ll i = lg; i--;) if (d >> i & 1) v = anc[v][i]; return v; }
inline ll LCA (ll v, ll u) {
if (h[v] > h[u]) swap(v, u);
u = up(u, h[u] - h[v]);
if (v == u) return v;
for (ll i = lg; i--;) if (anc[v][i] ^ anc[u][i]) v = anc[v][i], u = anc[u][i];
return anc[v][0];
}
ll fnd (cl &v) { return par[v] = (ok[par[v]] ? par[v] : fnd(anc[par[v]][0])); }
void init (int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
n = N, m = M;
memset(par, -1, sizeof par);
iota(id, id + m, 0);
sort(id, id + m, [&](cl &x, cl &y) { return W[x] < W[y]; });
for (ll i = 0; i < m; i++) unite(V[id[i]], U[id[i]], W[id[i]]);
ok[n] = true; adj[n].push_back(n - 1); cost[n] = -1;
DFS();
}
int getMinimumFuelCapacity (int X, int Y) { return cost[fnd(LCA(X, Y))]; }
/*
*/
