#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> u;
vector<int> v;
vector<int> w;
vector<vector<int>> edges;
multiset<int> ms;
const int INF = 1e9 + 1;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
n = N;
m = M;
u = U;
v = V;
w = W;
edges = vector<vector<int>>(n,vector<int>(n));
for(int i = 0; i < n; i++){
edges[u[i]][v[i]] = i;
ms.insert(w[i]);
}
}
int getMinimumFuelCapacity(int x, int y) {
if(n - 1 <= 2) return -1;
if(x == 0){
ms.erase(ms.find(w[edges[x][y]]));
int minx = *ms.begin(); int sminx = *(next(ms.begin()));
ms.insert(w[edges[x][y]]);
return max({w[edges[x][y]],minx,sminx});
} else{
ms.erase(ms.find(w[edges[0][x]]));
ms.erase(ms.find(w[edges[0][y]]));
int minx = *ms.begin();
ms.insert(w[edges[0][x]]);
ms.insert(w[edges[0][y]]);
return max({w[edges[0][x]],w[edges[0][y]],minx});
}
}
// int main() {
// int N, M;
// assert(2 == scanf("%d %d", &N, &M));
// std::vector<int> U(M), V(M), W(M);
// for (int i = 0; i < M; ++i) {
// assert(3 == scanf("%d %d %d", &U[i], &V[i], &W[i]));
// }
// int Q;
// assert(1 == scanf("%d", &Q));
// std::vector<int> X(Q), Y(Q);
// for (int i = 0; i < Q; ++i) {
// assert(2 == scanf("%d %d", &X[i], &Y[i]));
// }
// init(N, M, U, V, W);
// std::vector<int> minimum_fuel_capacities(Q);
// for (int i = 0; i < Q; ++i) {
// minimum_fuel_capacities[i] = getMinimumFuelCapacity(X[i], Y[i]);
// }
// for (int i = 0; i < Q; ++i) {
// printf("%d\n", minimum_fuel_capacities[i]);
// }
// return 0;
// }
