#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n, L;
const int maxN = 1e5 + 10;
bool Q;
struct Line {
    mutable ll k, m, p;
    bool operator<(const Line& o) const {
        return Q ? p < o.p : k < o.k;
    }
};
struct LineContainer : multiset<Line> {
    // (for doubles, use inf = 1/.0, div(a,b) = a/b)
    const ll inf = LLONG_MAX;
    ll div(ll a, ll b) { // floored division
        return a / b - ((a ^ b) < 0 && a % b); }
    bool isect(iterator x, iterator y) {
        if (y == end()) { x->p = inf; return false; }
        if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
        else x->p = div(y->m - x->m, x->k - y->k);
        return x->p >= y->p;
    }
    void add(ll k, ll m) {
        auto z = insert({k, m, 0}), y = z++, x = y;
        while (isect(y, z)) z = erase(z);
        if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
        while ((y = x) != begin() && (--x)->p >= y->p)
            isect(x, erase(y));
    }
    ll query(ll x) {
        assert(!empty());
        Q = 1; auto l = *lower_bound({0,0,x}); Q = 0;
        return l.k * x + l.m;
    }
};
vector<pair<int,int>> g[maxN];
ll h[maxN];
ll dp[maxN];
LineContainer lc[maxN];
void dfs(int v, int p) {
    bool was = false;
    lc[v].clear();
    for (auto& it : g[v]) {
        if (it.first == p) continue;
        h[it.first] = h[v] + it.second;
        dfs(it.first, v);
        ll C = -lc[it.first].query(h[v] + L) + (h[v] + L) * (h[v] + L);
        if (!was) {
            was = true;
            dp[v] = C;
        }
        else {
            dp[v] = min(dp[v], C);
        }
        if (lc[v].size() < lc[it.first].size()) {
            swap(lc[v], lc[it.first]);
        }
        for (auto& f : lc[it.first]) {
            lc[v].add(f.k, f.m);
        }
        lc[it.first].clear();
    }
    if (!was) dp[v] = 0;
    lc[v].add(2 * h[v], -dp[v] - h[v] * h[v]);
}
void solve() {
    cin >> n >> L;
    for (int i = 1; i <= n; i++) {
        g[i].clear();
    }
    for (int i = 1; i < n; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].emplace_back(v, w);
        g[v].emplace_back(u, w);
    }
    int q;
    cin >> q;
    while (q--) {
        int p;
        cin >> p;
        dfs(p, -1);
        cout << dp[p] << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }
    return 0;
}