#include "swap.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <math.h>
#include <iomanip>
#define rep(i, s, e) for (ll i = s; i < e; i++)
#define upmax(a, b) a = max(a, b)
#define upmin(a, b) a = min(a, b)
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
ll n, m;
ll max_edge = -1;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
n = N, m = M;
max_edge = -1;
rep(i, 0, m) upmax(max_edge, (ll)W[i]);
}
int getMinimumFuelCapacity(int X, int Y) {
if (m == n - 1) {
return -1;
}
return max_edge;
}
