#include "swap.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
#define pb push_back
#define po pop_back
#define ff first
#define ss second
#define MIN -1e18
#define MAX 1e18
#define lw lower_bound
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,mid,mn,T,sum,h1,h2,c[1234567],x,y,z,l,r,cnt,cnt1,ans;
map<ll,ll> mp;
vector<pair<ll,pl>> edge;
ll firstnum,secondnum;
bool ok,ok1;
ll par[1234567],path[1234567],sz[1234567],w,mx[1234567];
void init(int N, int M,
std::vector<int> U, std::vector<int> V, std::vector<int> W) {
for(int i=0;i<M;i++){
edge.pb({W[i],{U[i],V[i]}});
}
n=N;
sort(edge.begin(),edge.end());
}
ll dsu(ll x){
if(par[x]==x)return x;
else return dsu(par[x]);
}
void connect(ll x,ll y){
x=dsu(x);
y=dsu(y);
if(x!=y){
par[y]=x;
mx[x]=max(mx[x],mx[y]);
sz[x]+=sz[y];
path[x]+=path[y];
}
}
bool check(ll x,ll y){
if(dsu(x)!=dsu(y))return false;
return true;
}
void run(){
for(int i=0;i<n;i++){
par[i]=i;
}
for(int i=0;i<n;i++){
c[i]=0;
path[i]=0;
sz[i]=1;
mx[i]=0;
}
}
int getMinimumFuelCapacity(int X, int Y) {
run();
for(auto u:edge){
x=u.ss.ff;
y=u.ss.ss;
connect(x,y);
c[x]++;
c[y]++;
x=dsu(x);
y=dsu(y);
path[x]++;
mx[x] = max(mx[x],c[u.ss.ff]);
mx[y] = max(mx[y],c[u.ss.ss]);
if(check(X,Y)==false)continue;
if(mx[dsu(X)]<3&&path[dsu(X)]<sz[dsu(X)])continue;
return u.ff;
}
return -1;
}
