#include "closing.h"
#include <bits/stdc++.h>

using namespace std;

typedef int ll;

const long long INF = 1'000'000'000'000'000'001;

vector<long long> dist(ll v, vector<vector<pair<ll, ll>>>& arr) {
	vector<long long> ans(arr.size(), INF);
	ans[v] = 0;
	priority_queue<pair<long long, ll>, vector<pair<long long, ll>>, greater<pair<long long, ll>>> pq;
	pq.emplace(0, v);
	while (!pq.empty()) {
		auto[d, nv] = pq.top();
		pq.pop();
		if (ans[nv] != d) {
			continue;
		}
		for (auto[i, c] : arr[nv]) {
			if (ans[i] > d + c) {
				ans[i] = d + c;
				pq.emplace(d + c, i);
			}
		}
	}
	return ans;
}

bool dfs(ll v, ll p, ll need, vector<vector<pair<ll, ll>>>& arr, vector<ll>& way) {
	way.push_back(v);
	if (v == need) {
		return true;
	}
	for (auto[i, _] : arr[v]) {
		if (i != p) {
			if (dfs(i, v, need, arr, way)) {
				return true;
			}
		}
	}
	way.pop_back();
	return false;
}

ll max_score(ll n, ll x, ll y, long long k, vector<ll> u, vector<ll> v, vector<ll> w) {
	vector<vector<pair<ll, ll>>> arr(n);
	for (ll i = 0; i < n - 1; i++) {
		arr[u[i]].emplace_back(v[i], w[i]);
		arr[v[i]].emplace_back(u[i], w[i]);
	}
	vector<long long> d1 = dist(x, arr), d2 = dist(y, arr);
	vector<ll> way;
	dfs(x, x, y, arr, way);
	vector<bool> inway(n, false);
	for (auto i : way) {
		inway[i] = true;
	}
	vector<long long> best(n * 2 + 1, INF);
	best[0] = 0;
	for (ll i = 0; i < n; i++) {
		if (inway[i]) {
			continue;
		}
		if (d1[i] > d2[i]) {
			swap(d1[i], d2[i]);
		}
		vector<long long> nbest = best;
		for (ll j = best.size() - 2; j >= 0; j--) {
			if (best[j + 1] > best[j] + d1[i]) {
				best[j + 1] = best[j] + d1[i];
			}
			if (j + 2 < best.size() && best[j + 2] > best[j] + d2[i]) {
				best[j + 2] = best[j] + d2[i];
			}
		}
	}
	vector<pair<long long, ll>> bas;
	for (ll i = 0; i < best.size(); i++) {
		bas.emplace_back(best[i], i);
	}
	ll bans = 0;
	for (ll i = 0; i < way.size(); i++) {
		ll nans = i + 1;
		k -= d1[way[i]];
		ll now = bas.size() - 1;
		long long nowk = k;
		for (ll j = way.size() - 1; j >= 0; j--) {
			nans++;
			if (j > i) {
				nowk -= d2[way[j]];
			} else {
				nowk += d1[way[j]];
				nowk -= max(d2[way[j]], d1[way[j]]);
			}
			if (nowk < 0) {
				break;
			}
			while (bas[now].first > nowk) {
				now--;
			}
			if (bans < nans + bas[now].second) {
				bans = nans + bas[now].second;
			}
		}
	}
	return bans;
}

#ifdef LOCAL
int main()
{

    int Q;
    assert(1 == scanf("%d", &Q));

    std::vector<int> N(Q), X(Q), Y(Q);
    std::vector<long long> K(Q);
    std::vector<std::vector<int>> U(Q), V(Q), W(Q);

    for (int q = 0; q < Q; q++)
    {
        assert(4 == scanf("%d %d %d %lld", &N[q], &X[q], &Y[q], &K[q]));

        U[q].resize(N[q] - 1);
        V[q].resize(N[q] - 1);
        W[q].resize(N[q] - 1);
        for (int i = 0; i < N[q] - 1; ++i)
        {
            assert(3 == scanf("%d %d %d", &U[q][i], &V[q][i], &W[q][i]));
        }
    }
    fclose(stdin);

    std::vector<int> result(Q);
    for (int q = 0; q < Q; q++)
    {
        result[q] = max_score(N[q], X[q], Y[q], K[q], U[q], V[q], W[q]);
    }

    for (int q = 0; q < Q; q++)
    {
        printf("%d\n", result[q]);
    }
    fclose(stdout);

    return 0;
}
#endif