#include "swap.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
vector<int>u,v,w,ind;
int m,n;
int ata[MAXN],sz[MAXN],cycle[MAXN];
bool cmp(int x,int y){
return (w[x]<w[y]);
}
void init(int N, int M,vector<int>U,vector<int> V,vector<int> W) {
u=U;v=V;w=W;m=M;n=N;
for(int i=0;i<m;i++)ind.pb(i);
sort(all(ind),cmp);
}
int tap(int x){
if(ata[x]==x)return x;
return ata[x]=tap(ata[x]);
}
void merge(int x,int y){
if((x=tap(x))==(y=tap(y))){
cycle[x]=1;
return;
}
if(sz[x]<sz[y])swap(x,y);
sz[x]+=sz[y];ata[y]=x;cycle[x]|=cycle[y];
}
int getMinimumFuelCapacity(int X, int Y){
for(int i=0;i<n;i++)ata[i]=i,sz[i]=1,cycle[i]=0;
for(int i=0;i<m;i++){
merge(u[ind[i]],v[ind[i]]);
if(tap(X)==tap(Y) and cycle[tap(X)])
return w[ind[i]];
}
return -1;
}
