#include "closing.h"
#include <bits/stdc++.h>
#define MAX 200005
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int visited[MAX];
vector<pii> graph[MAX];
ll dist1[MAX], dist2[MAX];
void dfs1(int node) {
visited[node] = 1;
for(auto [v, w] : graph[node]) {
if(visited[v]) continue;
dist1[v] = dist1[node] + w;
dfs1(v);
}
}
void dfs2(int node) {
visited[node] = 1;
for(auto [v, w] : graph[node]) {
if(visited[v]) continue;
dist2[v] = dist2[node] + w;
dfs2(v);
}
}
ll c[MAX];
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
for(int i = 0; i < N; ++i) graph[i].clear();
for(int i = 0; i < N - 1; ++i) {
graph[U[i]].push_back({V[i], W[i]});
graph[V[i]].push_back({U[i], W[i]});
}
for(int i = 0; i < N; ++i) visited[i] = dist1[i] = 0;
dfs1(X);
for(int i = 0; i < N; ++i) visited[i] = dist2[i] = 0;
dfs2(Y);
int ans = 0;
for(int i = 0; i <= X; ++i) for(int j = X; j < N; ++j) {
for(int p = 0; p <= Y; ++p) for(int q = Y; q < N; ++q) {
for(int k = 0; k < N; ++k) c[k] = 0;
for(int k = i; k <= j; ++k) c[k] = max(c[k], dist1[k]);
for(int k = p; k <= q; ++k) c[k] = max(c[k], dist2[k]);
ll sum = 0;
for(int k = 0; k < N; ++k) sum += c[k];
if(sum <= K) ans = max(ans, j - i + q - p + 2);
}
}
return ans;
}
