1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152

// Code By Chen Qiqian on 2018.10.13
#include <cstdio>
#include <algorithm>
#include <vector>
#include <unistd.h>
#define ll long long
#define inf 0x3f3f3f3f3f3f
using namespace std;

const int MAXN = 610000;


struct Edge{
  int to,len,nex;
}edge[MAXN];int ecnt = 2,fir[MAXN];
void addedge(int a,int b,int c){
  edge[ecnt] = (Edge){b,c,fir[a]};
  fir[a] = ecnt++;
}


int n,m;
ll w[MAXN];
int dep[MAXN],siz[MAXN],son[MAXN],fa[MAXN],top[MAXN],dfn[MAXN],tot;

void init(){
  scanf("%d",&n);
  for(int i = 1;i<=n-1;i++){
    int u,v,c;
    scanf("%d %d %d",&u,&v,&c);
    addedge(u,v,c),addedge(v,u,c);
  }
}

void dfs1(int nown,int f,int depth){
  dep[nown] = depth,fa[nown] = f;
  siz[nown] = 1,son[nown] = 0;
  for(int nowe = fir[nown];nowe;nowe = edge[nowe].nex){
    int v = edge[nowe].to,l = edge[nowe].len;
    if(v == fa[nown]) continue;
    w[v] = min(w[nown],(ll)l);
    dfs1(v,nown,depth+1);
    siz[nown] += siz[v];
    if(siz[v] > siz[son[nown]]) son[nown] = v;
  }
}

void dfs2(int nown,int topf){
  dfn[nown] = ++tot;top[nown] = topf;
  if(!son[nown]) return;
  dfs2(son[nown],topf);
  for(int nowe = fir[nown];nowe;nowe = edge[nowe].nex){
    int v = edge[nowe].to;//l = edge[nowe].len;
    if(v == fa[nown] || v == son[nown]) continue;
    dfs2(v,v);
  }
}

int lca(int x,int y){
  if(x == 0 || y == 0) return 0;
  while(top[x] != top[y]){
    if(dep[top[x]] < dep[top[y]]) swap(x,y);
    x = fa[top[x]];
  }
  if(dep[x] > dep[y]) swap(x,y);
  return x;
}

void build(){
  w[1] = inf;
  dfs1(1,0,1);
  dfs2(1,1);
}

int k,kp[MAXN],type[MAXN];

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

Edge _edge[MAXN];int _ecnt = 2,_fir[MAXN];
void _addedge(int a,int b,int c = 0){
  _edge[_ecnt] = (Edge){b,c,_fir[a]};
  _fir[a] = _ecnt++;
}

ll _dfs(int nown){
  ll tmp = 0;
  if(type[nown])
    return (ll)w[nown];
  for(int nowe = _fir[nown];nowe;nowe = _edge[nowe].nex){
    int v = _edge[nowe].to;
    tmp += _dfs(v);
  }
  return min(tmp,(ll)w[nown]);
}


void solve_tree(){
  sort(kp+1,kp+k+1,cmp);
  _ecnt = 2;
  static int stk[MAXN];int top = 0,cnt = k;//[0,top]
  for(int i = 1;i<=k;i++){
    type[kp[i]] = 1;
    int L = lca(kp[i],stk[top]);
    if(L == stk[top])
      stk[++top] = kp[i];
    else{
      while(top >= 1 && dep[stk[top-1]] >= dep[L]){
        int nown = stk[top-1],v = stk[top];
        _addedge(nown,v);
        top--;
      }
      if(stk[top] != L){
        _addedge(L,stk[top]);
        stk[top] = L;
        kp[++cnt] = L;
      }
      stk[++top] = kp[i];
    }
  }
  while(top >= 1)
    _addedge(stk[top-1],stk[top]),top--;
  
  type[1] = 0;
  printf("%lld\n",_dfs(1));
  for(int i = 1;i<=k;i++)
    type[kp[i]] = 0;
  for(int i = 1;i<=cnt;i++)
    _fir[kp[i]] = 0;
}



void solve(){
  scanf("%d",&m);
  for(int i = 1;i<=m;i++){
    scanf("%d",&k);
    for(int j = 1;j<=k;j++)
      scanf("%d",&kp[j]);
    kp[++k] = 1;
    solve_tree();
  }
}


signed main(){
  init();
  build();
  solve();
  return 0;
}