#include "closing.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 2e5+1, inf = 2e18;
vector<pii> edges[LIM];
vi distX(LIM),distY(LIM);
void dfs(int node,int p,int flag,int cur) {
if (!flag) distX[node] = cur;
else distY[node] = cur;
for (auto it : edges[node]) {
if (it.ff == p) continue;
dfs(it.ff,node,flag,cur+it.ss);
}
}
signed max_score(signed N, signed X, signed Y, int K,
std::vector<signed> U, std::vector<signed> V, std::vector<signed> W)
{
if (X > Y) swap(X,Y);
for (int i = 0;i<N;i++) edges[i].clear();
int M = big(U);
for (int i = 0;i<M;i++) {
edges[U[i]].push_back({V[i],W[i]});
edges[V[i]].push_back({U[i],W[i]});
}
dfs(X,X,0,0),dfs(Y,Y,1,0);
int ansy = 0;
for (signed L = 0;L<N;L++) {
for (signed R = L;R < N;R++) {
int k =K;
int ans = 0;
int fl = 1;
for (signed j = min(L,X);j<=max(Y,R);j++) {
int cost;
if (j >= L && j <= R) cost = max(distX[j],distY[j]);
else if (j <= X) cost = distX[j];
else cost = distY[j];
int contr = (j >= L && j <= R) ? 2 : 1;
if (cost > k) {
fl = 0;
break;
}
k-=cost;
ans+=contr;
}
priority_queue<pii,vector<pii>,greater<pii>> pq;
if (min(L,X)) pq.push({distX[min(L,X)-1],min(L,X)-1});
if (max(Y,R)<N-1) pq.push({distY[max(Y,R)+1],max(Y,R)+1});
while (!pq.empty()) {
auto [cost,place] = pq.top();
pq.pop();
if (cost > k) break;
k-=cost;
ans++;
if (place < min(L,X) && place) {
pq.push({distX[place-1],place-1});
}
if (place > max(R,Y) && place < N-1) {
pq.push({distY[place+1],place+1});
}
}
if (fl) ansy = max(ansy,ans);
//cout << L sp R sp ans << endl;
}
}
for (int i=X;i<Y;i++) {
priority_queue<pii,vector<pii>,greater<pii>> pq;
pq.push({distX[X],X});
pq.push({distY[Y],Y});
int ans = 0;
int k = K;
while (!pq.empty()) {
auto [cost,place] = pq.top();
pq.pop();
if (cost > k) break;
k-=cost;
ans++;
if (place <= i) {
if (place < i && place >= X) {
pq.push({distX[place+1],place+1});
}
if (place <= X && place) {
pq.push({distX[place-1],place-1});
}
}
else {
if (place > i+1 && place <= Y) {
pq.push({distY[place-1],place-1});
}
if (place != N-1 && place >= Y) {
pq.push({distY[place+1],place+1});
}
}
}
//cout << i sp ans << endl;
ansy = max(ansy,ans);
}
return ansy;
}
