#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
    {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
    {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T> ostream& operator<<(ostream& s, set<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T> ostream& operator<<(ostream& s, multiset<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
    #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
    #define dump(...)
    #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(nullptr); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

// edgeを貼ったあとにbuild()を忘れない！
struct TreeDoubling {
    struct Edge {
        int to, len;
    };  // 場合に応じて書き換える、toは必須
    vector<vector<Edge>> g;
    int n, size;  // MSB + 1
    int root;
    vector<int> depth;
    vector<vector<int>> parent;  // ダミー頂点n(親もn)
    TreeDoubling(int n) : g(n), n(n), depth(n), size(64 - __builtin_clzll(n)) {
        parent.resize(size, vector<int>(n + 1, n));
    }
    void dfs(int v, int prev, int d) {
        depth[v] = d;
        parent[0][v] = prev;
        for (auto& s : g[v])
            if (s.to != prev) {
                dfs(s.to, v, d + 1);
            }
    }
    void build(int root_ = 0) {
        root = root_;
        dfs(root, n, 0);
        for (int k = 0; k < size - 1; k++) {
            for (int i = 0; i < n; i++) {
                parent[k + 1][i] = parent[k][parent[k][i]];
            }
        }
    }

    // vからd個分親にさかのぼった頂点、rootよりも上はnを返す
    int query(int v, int d) {
        int ret = v;
        for (int j = 0; j < size; j++) {
            if (d >> j & 1) ret = parent[j][ret];
        }
        return ret;
    }
    int lca(int u, int v) {
        if (depth[u] > depth[v]) swap(u, v);
        v = query(v, depth[v] - depth[u]);
        if (u == v) return u;

        for (int j = size - 1; j >= 0; j--) {
            if (parent[j][u] == parent[j][v]) continue;
            u = parent[j][u];
            v = parent[j][v];
        }
        assert(parent[0][u] == parent[0][v]);
        return parent[0][u];
    }
};

signed main() {
    int n; cin >> n;
    TreeDoubling td(n);
    REP (i, n - 1) {
        int u, v, w; cin >> u >> v >> w;
        // td.g[u].emplace_back(v, w);
        td.g[u].push_back({v, w});
        td.g[v].push_back({u, w});
    }
    td.build();
    vector<int> d(n);
    function<void(int, int)> dfs = [&](int v, int prev) {
        for (auto& p : td.g[v]) if (p.to != prev) {
            d[p.to] = d[v] + p.len;
            dfs(p.to, v);
        }
    };
    dfs(0, -1);

    vector<int> ls(n), rs(n);
    function<void(int, int, int&)> dfs2 = [&](int v, int p, int& idx) {
        for (auto& s : td.g[v]) if (s.to != p) {
        ls[v] = idx++;
            dfs2(s.to, v, idx);
        rs[v] = idx++;
        }
    };

    int Q; cin >> Q;
    REP (q, Q) {
        int K; cin >> K;
        vector<int> xs(K); REP (i, K) cin >> xs[i];
        sort(ALL(xs), [&](int i, int j) {
            return ls[i] < ls[j];
        });
        int acc = 0;
        int ans = 0;
        REP (i, xs.size()) {
            acc = td.lca(acc, xs[i]);
            ans += d[xs[i]];
            if (i < (int)xs.size() - 1) {
                int lca = td.lca(xs[i], xs[i + 1]);
                ans -= d[lca];
            }
        }
        ans -= d[acc];
        cout << ans << endl;
    }
}