#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
const int MN = 1e5+5;
const int INF = 1e9+10;
int n, m;
int par[MN], sz[MN], large[MN];
vector<tuple<int, int, int>> edges;
vector<vector<int>> g;
vector<int> deg;
vector<bool> av, inPath, vis, cyc;
int ans1 = 0, ans2 = 0;
int find(int u) {
if (par[u] == u) return u;
return par[u] = find(par[u]);
}
void merge(int e) {
int u = get<1>(edges[e]);
int v = get<2>(edges[e]);
u = find(u);
v = find(v);
if (u == v) {
cyc[u] = true;
return;
}
if (sz[u] > sz[v]) swap(u, v);
par[u] = v;
sz[v] += sz[u];
cyc[v] = cyc[u] || cyc[v];
}
bool dfs1(int node, int targ, int prev = 0) {
vis[node] = true;
if (node == targ) {
inPath[node] = true;
return true;
}
for (auto e: g[node]) {
if (!av[e]) continue;
int v = get<2>(edges[e]) ^ get<1>(edges[e]) ^ node;
if (v == prev) continue;
if (!vis[v]) dfs1(v, targ, node);
inPath[node] = inPath[node] || inPath[v];
}
return inPath[node];
}
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
n = N;
m = M;
for (int i = 0; i < m; i++) {
edges.push_back({W[i], U[i], V[i]});
}
sort(edges.begin(), edges.end());
g.resize(n);
for (int i = 0; i < m; i++) {
int u = get<1>(edges[i]);
int v = get<2>(edges[i]);
g[u].push_back(i);
g[v].push_back(i);
}
}
int getMinimumFuelCapacity(int X, int Y) {
int a = X, b = Y;
int ans = INF;
cyc.assign(n, 0);
for (int i = 0; i < n; i++) {
par[i] = i;
sz[i] = 1;
large[i] = 0;
}
for (int i = 0; i < m; i++) {
merge(i);
if (find(a) == find(b) && cyc[find(a)]) return get<0>(edges[i]);
}
return -1;
}
