#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

#ifndef LOCAL
#define LOG(...) 42
#endif

#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

typedef long long LL;
typedef pair <int, int> PII;

constexpr double EPS = 1e-8;
const double PI = acos(-1);

int multi_cases = 1;

void A_SOUL_AvA () {
    int n;
    cin >> n;

    vector <array<int, 2>> adj[n * 2 + 1];
    for (int i = 1; i < n; i++) {
        int u, v, w;
        cin >> u >> v >> w;

        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }

    int k, p, S, T;
    cin >> k >> p >> S >> T;

    vector <int> dep(n + 1);
    dep[1] = 1;
    function <void(int, int)> DFS = [&](int u, int fa) {
        for (auto &[v, w] : adj[u]) {
            if (v != fa) {
                dep[v] = dep[u] + 1;
                DFS(v, u);
            }
        }
    };
    DFS(1, -1);

    for (int i = 1; i <= n; i++) {
        int x = dep[i] + n;
        adj[i].pb({x, 0});
        if (x - k >= n + 1) adj[x - k].pb({i, p});
        if (x + k <= n * 2) adj[x + k].pb({i, p});
    }

    const LL inf = 1e18;
    auto dij = [&]() {
        vector <LL> dis(n * 2 + 5, inf);
        vector <int> st(n * 2 + 5);
        dis[S] = 0;
        priority_queue <pair<LL, int>, vector<pair<LL, int>>, greater<>> q;
        q.push({0, S});

        while (q.size()) {
            auto [d, u] = q.top();
            q.pop();
            if (st[u]) continue;
            st[u] = 1;

            for (auto &[v, w] : adj[u]) {
                if (dis[v] > d + w) {
                    dis[v] = d + w;
                    q.push({dis[v], v});
                }
            }
        }
        return dis[T];
    };

    cout << dij() << endl;
}

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int T = 1;
    for (multi_cases && cin >> T; T; T--) {
        A_SOUL_AvA ();
    }

    return 0;
}