//Man always remember love because of romance only!
#include<bits/stdc++.h>
using namespace std;
inline int read(){
    int X=0,w=0; char ch=0;
    while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
    while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
    return w?-X:X;
}
inline void write(int x){
	if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
#define ll long long
const int N = 200500;
const int Delta = 1e9;
const int Len = Delta << 1;

vector<array<int, 2>> e[N];
ll dis[N];
int T[N], tot, cnt;
int rt;
int L;

int ls[N << 6], rs[N << 6];
ll n, ans[N];
struct line {
	ll k, b;
} p[N << 6];

inline ll calc(line l, ll x) { return l.k * x + l.b; }

void insert(int &x, int l, int r, line num) {
	if (!x) return x = ++cnt, p[x] = num, void();
	int mid = ((ll) l + r) >> 1;
	if (calc(p[x], mid) > calc(num, mid)) swap(p[x], num);
	if (calc(p[x], l) <= calc(num, l) && calc(p[x], r) <= calc(num, r)) return;
	if (calc(p[x], l) > calc(num, l))
		insert(ls[x], l, mid, num);
	else
		insert(rs[x], mid + 1, r, num);
}

const ll INF = 0x7fffffffffff;
ll query(int now, int l, int r, ll x) {
	if (!now) return INF;
	int mid = ((ll) l + r) >> 1;
	return min(calc(p[now], x), x <= mid ? query(ls[now], l, mid, x) : query(rs[now], mid + 1, r, x));
}

int merge(int x, int y, int l, int r) {
	if (!x || !y) return x | y;
	insert(x, l, r, p[y]);
	int mid = ((ll) l + r) >> 1;
	ls[x] = merge(ls[x], ls[y], l, mid);
	rs[x] = merge(rs[x], rs[y], mid + 1, r);
	return x;
}

void dfs(int x, int fa) {
	int go = 0;
	for (auto [y, w] : e[x]) {
		if (y == fa) continue;
		go++;
		dis[y] = dis[x] + w;
		dfs(y, x);
		T[x] = merge(T[x], T[y], 1, Len);
	}
	ans[x] = dis[x] * dis[x] + query(T[x], 1, Len, dis[x] + Delta);
	if (x != rt && !go) ans[x] = 0;
	insert(T[x], 1, Len, {-2 * (dis[x] - L), ans[x] + (dis[x] - L) * (dis[x] - L) + 2 * (dis[x] - L) * Delta});
}

void solve() {
	cin >> n >> L;
	for (int i = 1; i < n; i++) {
		int x, y, w;
		cin >> x >> y >> w;
		e[x].push_back({y, w});
		e[y].push_back({x, w});
	}
	int q;
	cin >> q;
	while (q--) {
		cin >> rt;
		dfs(rt, 0);
		cout << ans[rt] << "\n";
		memset(dis, 0, sizeof dis);
		memset(T, 0, sizeof(T));
		tot = cnt = 0;
		memset(ls, 0, sizeof(ls));
		memset(rs, 0, sizeof(rs));
		memset(p, 0, sizeof(p));
		memset(ans, 0, sizeof(ans));
	}
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	while (t--) {
		solve();
		for (int i = 1; i <= n; i++) {
			e[i].clear();
		}
	}
	return 0;
}