#include <bits/stdc++.h>
#define pb push_back
#define lint long long int
using namespace std;
vector<vector<pair<int, int>>> edge;
vector<bool> visited;
bool is_cycle = false;
int max_l = 0;
void dfs(int v, int p) {
visited[v] = true;
for (auto i : edge[v]) {
if (i.first == p) continue;
if (visited[i.first]) {
is_cycle = true;
}
if (!visited[i.first]) {
max_l = max(max_l, i.second);
dfs(i.first, v);
}
}
}
void init(int n, int m, vector<int> U, vector<int> V, vector<int> W) {
edge.resize(n+1);
for (int i = 0; i < m; i ++) {
edge[U[i]].pb({V[i], W[i]});
edge[V[i]].pb({U[i], W[i]});
}
visited.resize(n, false);
dfs(0, -1);
}
int getMinimumFuelCapacity(int x, int y) {
if (!is_cycle) {return -1;}
else {return max_l;}
}
