#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>
#define all(x) x.begin() , x.end()
const int N = 1e5;
int n , m;
vector<int> u , v , w;
multiset<int> st;
int val[N];
void init(int N, int M,vector<int> U, vector<int> V, vector<int> W) {
if (M != N-1) return;
n = N , m = M , u = U , V = v , w = W;
for (int i = 0; i < N-1 ; i++){
val[V[i]] = W[i];
st.insert(W[i]);
}
}
int getMinimumFuelCapacity(int X, int Y) {
if (m != n-1) return -1;
if (X == 0 || Y == 0 || n < 4) return -1;
st.erase(st.find(val[X])); st.erase(st.find(val[Y]));
int ans = max({*st.begin() , val[X] , val[Y]});
st.insert(val[X]); st.insert(val[Y]);
return ans;
}
