#include "swap.h"
#include <bits/stdc++.h>
#define ll int
#define ln "\n"
using namespace std;
ll n, m;
vector<array<ll, 3>> e;
vector<ll> enabled;
vector<vector<ll>> A;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
n=N; m=M; A.resize(n); e.resize(m);
for (ll i=0; i<m; i++){
e[i] = {U[i], V[i], W[i]};
A[U[i]].push_back(i); A[V[i]].push_back(i);
}
}
void dfs(ll u, vector<ll> &dp, vector<ll> &vis){
ll my = 0; dp[u]=0; vis[u]=1;
for (auto i:A[u]){
ll v = e[i][0]^e[i][1]^u;
if (!enabled[i]) continue;
if (!vis[v]) dfs(v, dp, vis);
my+=dp[v];
}
dp[u]=my;
}
int getMinimumFuelCapacity(int X, int Y) {
ll l=0, r=2e9; vector<ll> dp(n), vis(n);
while (l+1<r){
ll mid = (l+r)/2;
enabled.assign(m, 0);
dp.assign(n, -1); vis.assign(n, 0);
for (ll i=0; i<m; i++){
if (e[i][2]<=mid) enabled[i]=1;
}
dp[Y]=1; dfs(X, dp, vis);
if (dp[X]>1){
r=mid;
}else l=mid;
}
return (r==2e9?-1:r);
}
