#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>
const int NN = 2e5 + 10;
vector<set<pair<int,int>>> adj(NN);
int n;
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++){
adj[U[i]].insert({W[i], V[i]});
adj[V[i]].insert({W[i], U[i]});
}
n = N;
}
int getMinimumFuelCapacity(int X, int Y) {
if(n == 2){
return -1;
}
if(n == 3){
return -1;
}
if(adj[X].size() == adj[Y].size()){
adj[0].erase({adj[X].begin()->first, X});
adj[0].erase({adj[Y].begin()->first, Y});
int ans = max({adj[X].begin()->first, adj[0].begin()->first, adj[Y].begin()->first});
adj[0].insert({adj[X].begin()->first, X});
adj[0].insert({adj[Y].begin()->first, Y});
return ans;
}
assert(X == 0 || Y == 0);
if(X != 0) swap(X, Y);
adj[X].erase({adj[Y].begin()->first, Y});
int ans = max({adj[X].begin()->first, next(adj[X].begin())->first, adj[Y].begin()->first});
adj[X].insert({adj[Y].begin()->first, Y});
return ans;
}
