# 描述

BaoBao has just found a rooted tree with vertices and weighted edges in his backyard. Among the vertices, of them are red, while the others are black. The root of the tree is vertex 1 and it’s a red vertex.

Let’s define the cost of a red vertex to be 0, and the cost of a black vertex to be the distance between this vertex and its nearest red ancestor.

Recall that

• The length of a path on the tree is the sum of the weights of the edges in this path.
• The distance between two vertices is the length of the shortest path on the tree to go from one vertex to the other.
• Vertex is the ancestor of vertex if it lies on the shortest path between vertex and the root of the tree (which is vertex 1 in this problem).

As BaoBao is bored, he decides to play games with the tree. For the -th game, BaoBao will select vertices on the tree and try to minimize the maximum cost of these vertices by changing at most one vertex on the tree to a red vertex.

Note that

• BaoBao is free to change any vertex among all the vertices to a red vertex, NOT necessary among the vertiecs whose maximum cost he tries to minimize.
• All the games are independent. That is to say, the tree BaoBao plays with in each game is always the initial given tree, NOT the tree modified during the last game by changing at most one vertex.

Please help BaoBao calculate the smallest possible maximum cost of the given vertices in each game after changing at most one vertex to a red vertex.

#### Input

There are multiple test cases. The first line of the input is an integer , indicating the number of test cases. For each test case:

The first line contains three integers , and (, ), indicating the size of the tree, the number of red vertices and the number of games.

The second line contains integers (), indicating the red vertices.

The following lines each contains three integers , and (, ), indicating an edge with weight connecting vertex and in the tree.

For the following lines, the -th line will first contain an integer (). Then integers follow (), indicating the vertices whose maximum cost BaoBao has to minimize.

It’s guaranteed that the sum of in all test cases will not exceed , and the sum of in all test cases will not exceed .

#### Output

For each test case output lines each containing one integer, indicating the smallest possible maximum cost of the vertices given in each game after changing at most one vertex in the tree to a red vertex.

#### Sample Input

``````2
12 2 4
1 9
1 2 1
2 3 4
3 4 3
3 5 2
2 6 2
6 7 1
6 8 2
2 9 5
9 10 2
9 11 3
1 12 10
3 3 7 8
4 4 5 7 8
4 7 8 10 11
3 4 5 12
3 2 3
1 2
1 2 1
1 3 1
1 1
2 1 2
3 1 2 3
``````

#### Sample Output

``````4
5
3
8
0
0
0
``````

#### Hint The first sample test case is shown above. Let’s denote as the cost of vertex .

For the 1st game, the best choice is to make vertex 2 red, so that , and . So the answer is 4.

For the 2nd game, the best choice is to make vertex 3 red, so that , , and . So the answer is 5.

For the 3rd game, the best choice is to make vertex 6 red, so that , , and . So the answer is 3.

For the 4th game, the best choice is to make vertex 12 red, so that , and . So the answer is 8.

Due to the design restrictions of ZOJ, we can only provide a subset of the testing data here (the original data is too large for ZOJ to store). We will update the testing data once we update ZOJ. Sorry for the inconvenience caused.

# 思路

• 红点：花费为0
• 黑点：花费为这个点与它离这个红色的点的最短距离。

# 代码

``````#include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const ll N = 1e5 + 10;
ll first[N], tot, r[N];
ll fa[N], dep[N], siz[N], son[N], top[N];
ll close[N], dis[N];
ll vv[N], vis[N];
ll n, m, q, k;
struct edge
{
ll v, w, next;
} e[N * 2];
void add_edge(ll u, ll v, ll w)
{
e[tot].v = v, e[tot].w = w;
e[tot].next = first[u];
first[u] = tot++;
}
void init()
{
mem(first, -1);
mem(r, 0);
mem(vis, 0);
tot = 0;
}
void dfs1(ll u, ll f, ll deep)
{
fa[u] = f;
dep[u] = deep;
siz[u] = 1;
son[u] = 0;
ll maxson = -1;
for (ll i = first[u]; ~i; i = e[i].next)
{
ll v = e[i].v;
if (v == f)
continue;
dfs1(v, u, deep + 1);
siz[u] += siz[v];
if (siz[v] > maxson)
{
son[u] = v;
maxson = siz[v];
}
}
}
void dfs2(ll u, ll topf)
{
top[u] = topf;
if (!son[u])
return;
dfs2(son[u], topf);
for (ll i = first[u]; ~i; i = e[i].next)
{
ll v = e[i].v;
if (v == fa[u] || v == son[u])
continue;
dfs2(v, v);
}
}
ll qlca(ll x, ll y)
{
while (top[x] != top[y])
{
if (dep[top[x]] < dep[top[y]])
swap(x, y);
x = fa[top[x]];
}
return dep[x] < dep[y] ? x : y;
}
void dfs(ll u, ll red)
{
close[u] = red;
for (ll i = first[u]; ~i; i = e[i].next)
{
ll v = e[i].v, w = e[i].w;
if (v == fa[u])
continue;
dis[v] = dis[u] + w;
if (r[v])
dfs(v, v);
else
dfs(v, red);
}
}
ll judge(ll mid)
{
ll lca = -1;
for (ll i = 1; i <= k; i++)
{
ll v = vv[i];
if (dis[v] - dis[close[v]] > mid) //如果当前点离红色的点的距离大于枚举的值的时候
{
vis[v] = 1;
if (lca == -1)
lca = v;
else
{
ll u = lca;
lca = qlca(lca, v);
}
}
else
vis[v] = 0;
}
if (lca == -1)
return 1;
//lca为当前找的最优点
for (ll i = 1; i <= k; i++)
if (vis[vv[i]])
{
ll v = vv[i];
if (dis[v] - dis[lca] > mid)
return 0;
}
return 1;
}
void solve()
{
ll x, u, v, w;
scanf("%lld%lld%lld", &n, &m, &q);
init();
for (ll i = 1; i <= m; i++)
{
scanf("%lld", &x);
r[x] = 1;
}
for (ll i = 1; i <= n - 1; i++)
{
scanf("%lld%lld%lld", &u, &v, &w);
}
dfs1(1, 0, 1);
dfs2(1, 1);
dfs(1, 1);
while (q--)
{
scanf("%lld", &k);
for (ll i = 1; i <= k; i++)
scanf("%lld", &vv[i]);
ll l = 0, r = 0;
for (ll i = 1; i <= k; i++)
r = max(r, dis[vv[i]] - dis[close[vv[i]]]); //找出没修改之前离红点最大的值
while (l < r)
{
ll mid = (l + r) >> 1;
if (judge(mid))
r = mid;
else
l = mid + 1;
}
printf("%lld\n", l);
}
}
int main()
{
//freopen("in.txt", "r", stdin);
ll t;
scanf("%lld", &t);
while (t--)
solve();
return 0;
}
`````` 