#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
void calc_dist(ll n, ll p, vector<ll> &dist, vector<vector<pll>> &g){
for(auto[i, d]: g[n]) if(i != p){
dist[i] = dist[n] + d;
calc_dist(i, n, dist, g);
}
}
int max_score(int N, int X, int Y, long long k, vector<int> u, vector<int> v, vector<int> w)
{
ll n = N, x = X, y = Y;
vector<vector<pll>> g(n);
for(ll i = 0; i < n-1; i++) g[u[i]].push_back({v[i], w[i]}), g[v[i]].push_back({u[i], w[i]});
vector<vector<ll>> dist(2, vector<ll>(n)), pref(2, vector<ll>(n+1));
calc_dist(x, -1, dist[0], g);
calc_dist(y, -1, dist[1], g);
// for(ll i = 0; i < n; i++) pref[0][i+1] = pref[0][i] + dist[0][i], pref[1][i+1] = pref[1][i] + dist[1][i];
// vector<vector<vector<ll>>> sums(2, vector<vector<ll>>(n, vector<ll>(n)));
// for(ll i = 0; i < n; i++) for(ll j = i; j < n; j++) sums[0][i][j] = pref[0][j+1] - pref[0][i], sums[1][i][j] = pref[1][j+1] - pref[1][i];
ll ans = 0;
for(ll i = 0; i < n; i++) for(ll j = i; j < n; j++) if(i <= y && y <= j) {
for(ll a = 0; a < n; a++) for(ll b = a; b < n; b++) if(a <= x && x <= b) {
ll s = 0;
for(ll l = 0; l < n; l++) {
if(a <= l && l <= b && i <= l && l <= j) s += max(dist[0][l], dist[1][l]);
else if(a <= l && l <= b) s += dist[0][l];
else if(i <= l && l <= j) s += dist[1][l];
}
if(s <= k) {
ans = max(ans, j - i + 1 + b - a + 1);
}
}
}
return ans;
}
