#include "factories.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=5e5+5, kx=19;
ll lvl[nx], pa[nx][kx], ds[nx];
vector<pair<ll, ll>> d[nx];
void dfs(int u, int p)
{
lvl[u]=lvl[p]+1;
pa[u][0]=p;
for (int i=1; i<kx; i++) pa[u][i]=pa[pa[u][i-1]][i-1];
for (auto [v, w]:d[u]) if (v!=p) ds[v]=ds[u]+w, dfs(v, u);
}
int lca(int u, int v)
{
if (lvl[u]>lvl[v]) swap(u, v);
for (int i=kx-1; i>=0; i--) if (lvl[pa[v][i]]>=lvl[u]) v=pa[v][i];
if (u==v) return v;
for (int i=kx-1; i>=0; i--) if (pa[u][i]!=pa[v][i]) u=pa[u][i], v=pa[v][i];
return pa[u][0];
}
void Init(int N, int A[], int B[], int D[]) {
for (int i=0; i<N-1; i++) d[A[i]].push_back({B[i], D[i]}), d[B[i]].push_back({A[i], D[i]});
dfs(0, 0);
}
long long Query(int S, int X[], int T, int Y[]) {
ll res=LLONG_MAX;
for (int i=0; i<S; i++) for (int j=0; j<T; j++) res=min(res, ds[X[i]]+ds[Y[j]]-2*ds[lca(X[i], Y[j])]);
return res;
}
