#include "factories.h"
#include<bits/stdc++.h>
using namespace std;
#define task "a"
#define se second
#define fi first
#define ll long long
#define ii pair<ll, ll>
const long mxN = 5e5 + 7;
int par[mxN][25], par_Cen[mxN], h[mxN], child[mxN];
bool del[mxN];
ll dis[mxN][25], mn[mxN];
vector<ii> w[mxN], par_dis[mxN];
void Buildlog(int j)
{
for (int i = 1; i <= __lg(h[j]); i++)
{
par[j][i] = par[par[j][i - 1]][i - 1];
dis[j][i] = dis[j][i - 1] + dis[par[j][i - 1]][i - 1];
}
}
void Build_LCA(int j)
{
Buildlog(j);
for (ii i : w[j])
{
if (h[i.fi])
continue;
par[i.fi][0] = j;
dis[i.fi][0] = i.se;
h[i.fi] = h[j] + 1;
Build_LCA(i.fi);
}
}
void Pre(int j, int par)
{
child[j] = 1;
for (ii i : w[j])
{
if (del[i.fi] || i.fi == par)
continue;
Pre(i.fi, j);
child[j] += child[i.fi];
}
}
int Find(int j, int sz)
{
for (ii i : w[j])
{
if (del[i.fi] || child[i.fi] > child[j])
continue;
if (child[i.fi] * 2 > sz)
return Find(i.fi, sz);
}
return j;
}
const ll inf = 1e18;
void Centroid(int j, int p)
{
Pre(j, 0);
j = Find(j, child[j]);
par_Cen[j] = p;
par_dis[j].push_back({j, 0});
mn[j] = inf;
del[j] = 1;
for (ii i : w[j])
{
if (del[i.fi])
continue;
Centroid(i.fi, j);
}
}
ll LCA(int u, int v)
{
if (h[u] < h[v])
swap(u, v);
ll res = 0;
for (int i = 19; i >= 0; i--)
{
if (h[u] - (1 << i) >= h[v])
{
res += dis[u][i];
u = par[u][i];
}
}
if (u == v)
return res;
for (int i = 19; i >= 0; i--)
{
if (par[u][i] != par[v][i])
{
res += dis[u][i] + dis[v][i];
u = par[u][i];
v = par[v][i];
}
}
return res + dis[u][0] + dis[v][0];
}
void Init(int N, int A[], int B[], int D[])
{
for (int i = 0; i < N - 1; i++)
{
A[i]++;
B[i]++;
w[A[i]].push_back({B[i], D[i]});
w[B[i]].push_back({A[i], D[i]});
}
h[1] = 1;
Build_LCA(1);
Centroid(1, 0);
for (int i = 1; i <= N; i++)
{
for (ii j : par_dis[par_Cen[i]])
par_dis[i].push_back({j.fi, LCA(j.fi, i)});
}
}
long long Query(int S, int X[], int T, int Y[])
{
vector<int> ver;
for (int i = 0; i < S; i++)
{
X[i]++;
for (ii j : par_dis[X[i]])
{
ver.push_back(j.fi);
mn[j.fi] = min(mn[j.fi], j.se);
}
}
ll ans = inf;
for (int i = 0; i < T; i++)
{
Y[i]++;
for (ii j : par_dis[Y[i]])
ans = min(ans, mn[j.fi] + j.se);
}
for (int i : ver)
mn[i] = inf;
return ans;
}
