#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
vector <vector <pair <int, int>>> adj;
int n, m;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
adj.resize(N+1);
n = N;
m = M;
for (int i = 0; i < M; i++) {
adj[U[i]].push_back({V[i], W[i]});
adj[V[i]].push_back({U[i], W[i]});
}
}
const int maxn = 1001;
int dis[maxn][maxn];
priority_queue <array <int, 3>> pq;
int processed[maxn][maxn];
int cnt = 0;
int getMinimumFuelCapacity(int x, int y) {
for (int i = 0; i < n; i++)
fill(dis[i], dis[i] + n + 1, 1e9 + 1);
dis[x][y] = 0;
cnt++;
pq.push({0, x, y});
while (!pq.empty()) {
int a = pq.top()[1], b = pq.top()[2];
pq.pop();
if (processed[a][b] == cnt)
continue;
processed[a][b] = cnt;
for (auto i : adj[a]) {
int d = max(dis[a][b], i.second);
if (d < dis[i.first][b] && i.first != b) {
dis[i.first][b] = d;
pq.push({-d, i.first, b});
}
}
for (auto j : adj[b]) {
int d = max(dis[a][b], j.second);
if (d < dis[a][j.first] && a != j.first) {
dis[a][j.first] = d;
pq.push({-d, a, j.first});
}
}
}
if (dis[y][x] == 1e9 + 1)
dis[y][x] = -1;
return dis[y][x];
}
// int main() {
// int N, M;
// cin >> N >> M;
// vector <int> u(M), v(M), w(M);
// for (int i = 0; i < M; i++)
// cin >> u[i] >> v[i] >> w[i];
// init(N, M, u, v, w);
// int q;
// cin >> q;
// while (q--) {
// int x, y;
// cin >> x >> y;
// cout << getMinimumFuelCapacity(x, y) << '\n';
// }
// }
