#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<V<pi>>;
using vvi = V<vi>;
#include "closing.h"
Adj G;
void dfs(int v, vl &dist, int p = -1) {
for (auto &[c, w] : G[v]) if (c != p) {
dist[c] = dist[v] + w;
dfs(c, dist, v);
}
}
int max_score(int N, int X, int Y, long long K,
std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
G.assign(N, {});
f0r(i, N-1) {
G[U[i]].pb({V[i], W[i]});
G[V[i]].pb({U[i], W[i]});
}
vl d1(N), d2(N);
dfs(X, d1);
dfs(Y, d2);
vl cst;
f0r(i, N) {
cst.pb(d1[i]);
cst.pb(d2[i]);
}
sort(all(cst));
ll tot = 0;
int cnt = 0;
f0r(i, 2*N) {
tot += cst[i];
if (tot <= K) ++cnt;
else break;
}
return cnt;
}
