#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define rep2r(i, l, r) for (int i = (r) - 1; i >= (l); i--)
#define range(a) a.begin(), a.end()

using namespace std;
using ll = long long;

struct HLD {
  vector<int> label, parent, head;
  vector<int> L, R;

  HLD(const vector<vector<int>> &g) : label(g.size()), parent(g.size()), head(g.size()), L(g.size()), R(g.size()) {
    const int n = g.size();
    vector<int> size(n, 1);
    auto dfs = [&](auto dfs, int u, int p) -> void {
      for (int v : g[u]) if (v != p) {
        dfs(dfs, v, u);
        size[u] += size[v];
      }
    };
    dfs(dfs, 0, -1);
    int k = 0;
    auto dfs2 = [&](auto dfs, int u, int p, int h) -> void {
      L[u] = k;
      label[u] = k++;
      head[u] = h;
      parent[u] = p;
      for (int v : g[u]) if (v != p && size[v] * 2 >  size[u]) dfs(dfs, v, u, h);
      for (int v : g[u]) if (v != p && size[v] * 2 <= size[u]) dfs(dfs, v, u, v);
      R[u] = k;
    };
    dfs2(dfs2, 0, -1, 0);
  }

  int lca(int u, int v) {
    for (;;) {
      if (label[u] > label[v]) swap(u, v);
      if (head[u] == head[v]) return u;
      v = parent[head[v]];
    }
  }

  template<class F> void each(int u, int v, F f) {
    for (;;) {
      if (label[u] > label[v]) swap(u, v);
      if (head[u] == head[v]) {
        f(label[u], label[v]);
        return;
      }
      f(label[head[v]], label[v]);
      v = parent[head[v]];
    }
  }

  template<class F> void each_edge(int u, int v, F f) {
    for (;;) {
      if (label[u] > label[v]) swap(u, v);
      if (head[u] == head[v]) {
        if (u != v) f(label[u] + 1, label[v]);
        return;
      }
      f(label[head[v]], label[v]);
      v = parent[head[v]];
    }
  }

  int operator[](int u) {
    return label[u];
  };
};


int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int N; cin >> N;
  vector<vector<int>> G(N);
  vector<vector<pair<int, ll>>> GW(N);
  rep(i, N - 1) {
    int a, b, c; cin >> a >> b >> c;
    G[a].push_back(b);
    G[b].push_back(a);
    GW[a].emplace_back(b, c);
    GW[b].emplace_back(a, c);
  }
  HLD hld(G);
  vector<ll> dep(N);
  auto dfs = [&](auto dfs, int u, int p) -> void {
    for (auto e : GW[u]) if (e.first != p) {
      dep[e.first] = dep[u] + e.second;
      dfs(dfs, e.first, u);
    }
  };
  dfs(dfs, 0, -1);
  int Q; cin >> Q;
  while (Q--) {
    int k; cin >> k;
    vector<int> a(k); rep(i, k) cin >> a[i];
    priority_queue<pair<int, int>> q;
    rep(i, k) q.emplace(hld[a[i]], a[i]);
    ll ans = 0;
    while (q.size() >= 2) {
      int u = q.top().second; q.pop();
      int v = q.top().second; q.pop();
      int w = hld.lca(u, v);
      ans += dep[u] + dep[v] - 2 * dep[w];
      q.emplace(hld[w], w);
    }
    cout << ans << '\n';
  }
}