#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = (a); i < (b); i++) 
#define _for(i, a, b) for(int i = (a); i <= (b); i++) 
using namespace std;

typedef long long ll;
const int N = 2e6 + 10;
ll d[N];
struct node
{
	int v; ll w;
	bool operator < (const node& rhs) const
	{
		return w > rhs.w;
	}
};
vector<pair<int, int>> g[N];
vector<int> ve[N];
int n, k, p, s, t, cnt;

void dfs(int u, int fa, int dep)
{
	ve[dep].push_back(u);
	for(auto [v, w]: g[u])
	{
		if(v == fa) continue;
		dfs(v, u, dep + 1);
	}
}

void solve()
{
	_for(i, 1, 2 * n) d[i] = 1e18;
	d[s] = 0;
	priority_queue<node> q;
	q.push({s, d[s]});

	while(!q.empty())
	{
		node x = q.top(); q.pop();
		int u = x.v;
		if(d[u] != x.w) continue;

		for(auto [v, w]: g[u])
			if(d[v] > d[u] + w)
			{
				d[v] = d[u] + w;
				q.push({v, d[v]});
			}
	}
}

int main()
{
	int T; scanf("%d", &T);
	while(T--)
	{
		scanf("%d", &n);
		_for(i, 1, 2 * n) g[i].clear(), ve[i].clear();
		_for(i, 1, n - 1)
		{
			int u, v, w;
			scanf("%d%d%d", &u, &v, &w);
			g[u].push_back({v, w});
			g[v].push_back({u, w});
		}
		scanf("%d%d%d%d", &k, &p, &s, &t);

		dfs(1, 0, 1);

		cnt = n;
		_for(i, 1, n)
		{
			if(!ve[i].size()) break;
			cnt++;
			for(int x: ve[i]) g[x].push_back({cnt, 0}); 
			for(int x: ve[i + k]) g[cnt].push_back({x, p});
			if(i - k >= 1) for(int x: ve[i - k]) g[cnt].push_back({x, p});
		}

		solve();
		printf("%lld\n", d[t]);
	}

	return 0; 
}