#include "swap.h"
#include <vector>
#include<set>
#include<algorithm>
#include<climits>
using namespace std;
// #define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define sz(x) (int)x.size()
const int MAXN = 1e5 + 5;
const int INF = INT_MAX;
const int LOGN = 22;
int n, m;
vector< pair <int,int> > g[MAXN];
bool cycle = 0;
int mx;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
n = N,m = M;
for(int i = 0;i < m;i++){
int u = U[i] + 1;
int v = V[i] + 1;
mx=max(mx, W[i]);
g[u].pb(mp(v, W[i]));
g[v].pb(mp(u, W[i]));
}
if(n == m){
cycle = 1;
}
}
int getMinimumFuelCapacity(int X, int Y) {
X++, Y++;
if(cycle==1){
return mx;
}
return -1;
}
