#include<algorithm>

#include<iostream>

#include<cstring>

#include<cctype>

#include<cstdio>

#include<cmath>

#include<stack>

using namespace std;

typedef long long ll;

const int N=,B=;

const int INF=0x7fffffff;

inline int read(){

    int X=,w=;char ch=;

    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}

    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();

    return w?-X:X;

}

struct node{

    int w,to,nxt;

}e[*N];

int n,m,cnt,head[N],dep[N];

int anc[N][B+],val[N][B+];

int aux[N],pos[N],stk[N],tot;

int fa_aux[N],tmp[N],num,top;

bool vis[N];

ll dp[N];

inline bool cmp(int a,int b){return pos[a]<pos[b];}

inline void add(int u,int v,int w){

    e[++cnt].to=v;e[cnt].w=w;e[cnt].nxt=head[u];head[u]=cnt;

}

void dfs(int u){

    pos[u]=++tot;dep[u]=dep[anc[u][]]+;

    for(int i=;i<=B;i++){

        anc[u][i]=anc[anc[u][i-]][i-];

        val[u][i]=min(val[u][i-],val[anc[u][i-]][i-]);

    }

    for(int i=head[u];i;i=e[i].nxt){

        int v=e[i].to,w=e[i].w;

        if(anc[u][]!=v){

            anc[v][]=u;val[v][]=w;

            dfs(v);

        }

    }

}

inline int LCA(int i,int j){

    if(dep[i]<dep[j])swap(i,j);

    for(int k=B;k>=;--k)

        if(dep[anc[i][k]]>=dep[j])i=anc[i][k];

    if(i==j)return i;

    for(int k=B;k>=;--k)

        if(anc[i][k]!=anc[j][k])

            i=anc[i][k],j=anc[j][k];

    return anc[i][];

}

void build(int t){

    sort(aux+,aux+t+,cmp);

    num=t;stk[top=]=;

    for(int i=;i<=t;i++){

        int u=aux[i];

        if(!top)fa_aux[u]=,stk[++top]=u;

        else{

            int lca=LCA(u,stk[top]);

            while(dep[stk[top]]>dep[lca]){

                if(dep[stk[top-]]<=dep[lca])

                    fa_aux[stk[top]]=lca;

                top--;

            }

            if(stk[top]!=lca){

                fa_aux[lca]=stk[top];

                stk[++top]=lca;

                aux[++num]=lca;

            }

            fa_aux[u]=lca;

            stk[++top]=u;

        }

    }

    sort(aux+,aux+num+,cmp);

}

inline ll cut(int u,int v){

    int res=INF;

    for(int i=B;i>=;i--)

        if(dep[anc[u][i]]>=dep[v]){

            res=min(res,val[u][i]);

            u=anc[u][i];

        }

    return res;

}

void solve(){

    for(int i=;i<=num;i++)dp[aux[i]]=;

    for(int i=num;i>=;i--){

        int u=aux[i],v=fa_aux[u];

        if(!vis[u])

            dp[v]+=min(dp[u],cut(u,v));

        else dp[v]+=cut(u,v);

    }

}

int main(){

    n=read();

    for(int i=;i<n;i++){

        int u=read(),v=read(),w=read();

        add(u,v,w);add(v,u,w);

    }

    dfs();

    m=read();

    while(m--){

        int t=read();

        for(int i=;i<=t;i++){

            int u=read();

            aux[i]=tmp[i]=u;vis[u]=;

        }

        aux[++t]=;

        build(t);solve();

        printf("%lld\n",dp[]);

        for(int i=;i<=t;i++)vis[tmp[i]]=;

    }

}