#include "factories.h"
#include <iostream>
#include <queue>
#include <cassert>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<long long, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define index(x, y) (int)(lower_bound(all(x), y) - x.begin())
#define pb push_back
#define _1 first
#define _2 second
#define INF (1LL<<60)
int N;
vector<P> G[500000];
long long D[500000];
void Init(int NN, int A[], int B[], int D[]) {
N = NN;
rep(i, N-1) {
G[A[i]].pb(P(B[i], D[i]));
G[B[i]].pb(P(A[i], D[i]));
}
}
long long Query(int S, int X[], int T, int Y[]) {
//cout<<"query {"; rep(i, S) cout<<X[i]<<",";cout<<"}, {";rep(i, T) cout<<Y[i]<<",";cout<<"}\n";
rep(i, N) D[i] = INF;
priority_queue<P, vector<P>, greater<P> > q;
rep(i, S) q.push(P(0, X[i])), D[X[i]] = 0;
while (!q.empty()) {
long long r = q.top()._1;
int x = q.top()._2;
q.pop();
if (D[x] < r) continue;
for (P p : G[x]) {
int t = p._1, len = p._2;
if (D[t] > r+len) {
D[t] = r+len;
q.push(P(D[t], t));
}
}
}
long long s = INF;
rep(i, T) s = min(s, D[Y[i]]);
return s;
}
