ZOJ red black tree

#include <bits/stdc++.h>
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define pb push_back
#define MP make_pair
#define lowbit(x) x&-x
#define clr(a) memset(a,0,sizeof(a))
#define _INF(a) memset(a,0x3f,sizeof(a))
#define FIN freopen("in.txt","r",stdin)
#define IOS ios::sync_with_stdio(false)
#define fuck(x) cout<<"["<<#x<<" "<<(x)<<"]"<<endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MX = 1e5 + ;

int n, m, q, _;
int red[MX];
struct edge
{
        int v, nxt;
        ll w;
} E[MX << ];
int head[MX], tot, sz;
int id[MX << ], dep[MX << ], first[MX], ST[MX << ][], vis[MX], vec[MX];
ll dis[MX], d[MX];
bool cmp(int a, int b)
{
        return d[a] > d[b];
}
void init(int _n)
{
        for (int i = ; i <= _n; i++)
        {
                head[i] = -;
                vis[i] = red[i] = dis[i] = d[i] = ;
        }
        tot = sz = ;
}
void add_edge(int u, int v, ll w)
{
        E[tot].v = v;
        E[tot].w = w;
        E[tot].nxt = head[u];
        head[u] = tot++;
}
void dfs(int u, int deep, ll nw)
{
        if (red[u])
        {
                nw = ;
        }
        d[u] = nw;
        vis[u] = ;
        id[++sz] = u;
        first[u] = sz;
        dep[sz] = deep;
        for (int i = head[u]; ~i; i = E[i].nxt)
        {
                int v = E[i].v;
                ll w = E[i].w;
                if (vis[v])
                {
                        continue;
                }
                dis[v] = dis[u] + w;
                dfs(v, deep + , nw + w);
                id[++sz] = u;
                dep[sz] = deep;
        }
}
void ST_init(int _n)
{
        for (int i = ; i <= _n; i++)
        {
                ST[i][] = i;
        }
        for (int j = ; ( << j) <= _n; j++)
        {
                for (int i = ; i + ( << j) < _n; i++)
                {
                        int x = ST[i][j - ], y = ST[i + ( << (j - ))][j - ];
                        ST[i][j] = dep[x] < dep[y] ? x : y;
                }
        }
}
int RMQ(int l, int r)
{
        int k = ;
        while (( << (k + )) <= r - l + )
        {
                k++;
        }
        int x = ST[l][k], y = ST[r - ( << k) + ][k];
        return dep[x] < dep[y] ? x : y;
}
int LCA(int u, int v)
{
        int x = first[u], y = first[v];
        if (x > y)
        {
                swap(x, y);
        }
        return id[RMQ(x, y)];
}

int main()
{
        //FIN;
        for (scanf("%d", &_); _; _--)
        {
                scanf("%d%d%d", &n, &m, &q);
                init(n);
                for (int i = , x; i <= m; i++)
                {
                        scanf("%d", &x);
                        red[x] = ;
                }
                for (int i = ; i < n; i++)
                {
                        int u, v, w;
                        scanf("%d%d%d", &u, &v, &w);
                        add_edge(u, v, w);
                        add_edge(v, u, w);
                }
                dfs(, , );
                ST_init(sz);
                while (q--)
                {
                        int k;
                        scanf("%d", &k);
                        for (int i = ; i <= k; i++)
                        {
                                scanf("%d", &vec[i]);
                        }
                        sort(vec + , vec + k + , cmp);
                        ll ans = d[vec[]], lastcnt = ;
                        int lastlca = vec[];
                        for (int i = ; i <= k; i++)
                        {
                                int lca = LCA(lastlca, vec[i]);
                                ll res1 = lastcnt + dis[lastlca] - dis[lca];
                                if (i >  && res1 >= d[vec[i - ]])
                                {
                                        break;
                                }
                                ll res2 = min(d[vec[i]], dis[vec[i]] - dis[lca]);
                                ll cnt = max(res1, res2);
                                if (cnt >= ans)
                                {
                                        break;
                                }
                                if (i +  <= k)
                                {
                                        ans = min(ans, max(cnt, d[vec[i + ]]));
                                }
                                else
                                {
                                        ans = min(ans, cnt);
                                }
                                lastlca = lca;
                                lastcnt = cnt;
                        }
                        printf("%lld\n", ans);
                }
        }
        return ;
}