#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define db double
#define ll long long
#define ar array
template<typename T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
vector<vector<ar<int, 3>>> adj;
int n, m;
void init(int N, int M,
std::vector<int> U, std::vector<int> V, std::vector<int> W) {
n = N, m = M;
adj.resize(N + 1);
for (int i = 0; i < M; i++) {
adj[U[i]].push_back({V[i], W[i], i});
adj[V[i]].push_back({U[i], W[i], i});
}
}
int getMinimumFuelCapacity(int X, int Y) {
auto good = [&](int mid) {
vector<bool> vis(n+1), vis2(m);
vector<int> dist(n+1, 1e9);
queue<int> q;
q.push(X), vis[X] = 1, dist[X] = 0;
int edges = 0;
while (q.size()) {
int v = q.front(); q.pop();
for (auto [u, w, idx] : adj[v]) if (w <= mid && !vis2[idx]) {
if (v == X || v == Y) {
if (!vis[u]) {
q.push(u), vis[u] = 1, dist[u] = dist[v] + 1;
}
continue;
}
edges++, vis2[idx] = 1;
if (!vis[u]) {
q.push(u), vis[u] = 1, dist[u] = dist[v] + 1;
}
}
}
return vis[Y] && edges > dist[Y];
};
int l = 1, r = 1e9, ans = 1e9;
if (!good(r)) return -1;
while (l <= r) {
int mid = (l+r)/2;
if (good(mid)) ans = mid, r = mid-1;
else l = mid+1;
}
return ans;
}
