#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define irreps(i, m, n) for (long long i = ((long long)(n)-1); i > (long long)(m); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) (long long)(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

const ll INF = 1e9+10;
const ll MOD = 1e9+7;
const ll LINF = 1e18;

class LCA{
  private:
  int n;
  int root;
  int k; // n<=2^kとなる最小のk
  vc<vc<int>> dp; // dp[i][j]:=要素jの2^i上の要素
  vc<int> depth;  // depth[i]:=rootに対する頂点iの深さ
  vll dist;
  vi nums;
  
  public:
  LCA(int _n, int _root, vc<vc<pair<int,ll>>>& _G){
    n=_n;
    root=_root;
    k=1;
    int nibeki=2;
    while(nibeki<n){
      nibeki<<=1;
      k++;
    }
    // 頂点iの親ノードを初期化
    dp = vc<vc<int>>(k+1, vc<int>(n, -1));
    depth.resize(n);
    dist.resize(n);
    nums.resize(n);
    int num=0;
    function<void(int, int)> _dfs=[&](int v, int p){
      dp[0][v]=p;
      nums[v]=num;
      num++;
      for(auto np: _G[v]){
        int nv; ll c; tie(nv,c)=np;
        if(nv==p) continue;
        depth[nv]=depth[v]+1;
        dist[nv]=dist[v]+c;
        _dfs(nv, v);
      }
    };
    _dfs(root, -1);
    // ダブリング
    rep(i,k){
      rep(j,n){
        dp[i+1][j]=dp[i][dp[i][j]];
      }
    }
  }
  
  int get(int u, int v){
    if(depth[u]<depth[v]) swap(u,v); // u側を深くする
    if(depth[u]!=depth[v]){
      ll d=depth[u]-depth[v];
      rep(i,k) if((d>>i)&1) u=dp[i][u];
    }
    if(u==v) return u;
    
    rrep(i,k){
      if(dp[i][u]!=dp[i][v]){
        u=dp[i][u], v=dp[i][v];
      }
    }
    return dp[0][u];
  }
  
  ll getDist(int u, int v){
    int lca=get(u,v);
    return dist[u]+dist[v]-2*dist[lca];
  }
  
  ll getDist(vi& v){
    int k=v.size();
    auto f=[&](int a, int b){ return nums[a]<nums[b]; };
    sort(all(v), f);
    // rep(i,k) cout<<v[i]<<' ';
    ll sum=0;
    rep(i,k){
      if(i==k-1) sum+=getDist(v[i],v[0]);
      else sum+=getDist(v[i], v[i+1]);
    }
    sum/=2;
    return sum;
  }
};

signed main()
{
  cin.tie( 0 ); ios::sync_with_stdio( false );
  
  ll n; cin>>n;
  vc<vc<pair<int,ll>>> G(n);
  rep(i,n-1){
    ll a,b,c; cin>>a>>b>>c;
    G[a].emplace_back(b,c);
    G[b].emplace_back(a,c);
  }
  
  auto lca=LCA(n, 0, G);
  
  ll q; cin>>q;
  while(q--){
    ll k; cin>>k;
    vi v(k);
    rep(i,k) cin>>v[i];
    cout<<lca.getDist(v)<<endl;
  }
  
  // cout<<lca.getDist(0,1)<<endl;
  // cout<<lca.getDist(0,3)<<endl;
  
}