#include "closing.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i = a;i < b;i++)
#define trav(nx, v) for(auto &nx : v)
#define all(a) begin(a), end(a)
#define sz(v) (int) v.size()


priority_queue <PLL, vector <PLL>, greater<PLL>> prim;
const int LIM = 200000;
vector <PLL> edge[LIM + 5];
bool isInside[LIM + 5];

int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W){
	rep(i,0,N) {
		edge[i].clear();
		isInside[i] = 0;
	}
	//~ cout << "Here " << U[0] << " " << V[0] << ""  << W[0] << endl;
	while(!prim.empty()) prim.pop();
	rep(i,0,N - 1){
		if(W[i] > K) continue;
		//~ cout << U[i] << " " << V[i] << endl;
		edge[U[i]].emplace_back(V[i], W[i]);
		edge[V[i]].emplace_back(U[i], W[i]);
		
	}
	isInside[X] = isInside[Y] = 1;
	LL ans = 2;
	trav(tmp, edge[X]){
		//~ cout << X << " " << tmp.fi << "?" << endl;
		prim.push({tmp.se, tmp.fi});
	}
	trav(tmp, edge[Y]) {
		prim.push({tmp.se, tmp.fi});
		//~ cout << Y << " " << tmp.fi << "?" << endl;
	}
	while(sz(prim)){
		auto currentTop = prim.top();
		//~ cout << "here " << K << " " << currentTop.fi << " " << currentTop.se << endl;
		prim.pop();
		if(K < currentTop.fi) break;
		if(isInside[currentTop.se]) continue;
		trav(cur, edge[currentTop.se]){
			prim.push({cur.se + currentTop.se, cur.fi});
		}
		K -= currentTop.fi;
		ans++;
		isInside[currentTop.se] = 1;
	}
    return ans;
}