#include "swap.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int MAXN = 1e5 + 5;
vector<pair<int, int>> w; // value, node
int n;
int s[MAXN];
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
n = N;
for (int i = 0; i < n - 1; i++)
w.push_back({W[i], V[i]}), s[V[i]] = W[i];
sort(w.begin(), w.end());
}
#define is_best(i) w[i] == s[1]
#define is_second(i) w[i] == s[2]
int getMinimumFuelCapacity(int x, int y) {
if (n <= 3) return -1;
if (x == 0){
int res = 2 * s[y];
int chose;
for (int i = 0; i < n; i++)
if (w[i].second != y) {chose = i, res += 2 * w[i].first; break;}
for (int i = 0; i < n; i++)
if (w[i].second != y and i != chose) {res += 2 * w[i].first; break;}
return res;
}
int res = 2 * s[y] + 2 * s[x];
for (int i = 0; i < n; i++)
if (w[i].second != x and w[i].second != y) {res += 2 * w[i].first; break;}
return res;
}
