#include "closing.h"
#include<bits/stdc++.h>
#define poly vector<ll>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < ll,ll >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
// #define int ll
// #define N 
using namespace std;
void dfs(int k,int fa,poly &dis,vector<vector<pa>> &G)
{
    for (auto [u,w]:G[k])
    {
        if (u==fa) continue;
        dis[u]=dis[k]+w;
        dfs(u,k,dis,G);
    }
}
int max_score(int n, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    // cerr<<"!!!!!!"<<endl;
    poly dx(n,0),dy(n,0);
    vector<vector<pa>>G(n,vector<pa>());
    for (int i=0;i+1<n;i++)
        G[U[i]].push_back(mp(V[i],W[i])),
        G[V[i]].push_back(mp(U[i],W[i]));
    dfs(X,X,dx,G);
    dfs(Y,Y,dy,G);
    // cerr<<"!!!!!!"<<endl;
    int ans=0;
    {
        priority_queue<pa>q;
        vector<bool>vis(n,0);
        for (int i=0;i<n;i++)
            q.push(mp(-dx[i],i)),q.push(mp(-dy[i],i));
        ll sm=0;
        int now=0;
        while (!q.empty())
        {
            int u=q.top().se;
            ll w=-q.top().fi;
            q.pop();
            if (vis[u]) continue;
            vis[u]=1;
            sm+=w;
            if (sm>K) break;
            now++;
        }
        ans=max(ans,now);
    }
    {
        priority_queue<pa,vector<pa>,greater<pa>>q;
        priority_queue<pa>qs;
        vector<int>vis(n,0);
        vector<poly>val(n,poly(3,-19));
        ll mn=dx[0]+dy[0];
        for (int i=0;i<n;i++)
        {
            if (dx[i]+dy[i]<mn) mn=min(mn,dx[i]+dy[i]);
        }
        int now=0;
        for (int i=0;i<n;i++)
            if (dx[i]+dy[i]==mn) K-=min(dx[i],dy[i]),vis[i]=1,q.push(mp(abs(dx[i]-dy[i]),i)),now++;
            else
            {
                // cout<<"!!!"<<i<<endl;
                vis[i]=0;
                q.push(mp(min(dx[i],dy[i]),i));
                val[i][0]=min(dx[i],dy[i]);
                val[i][1]=abs(dx[i]-dy[i]);
            }
        // cout<<"??"<<now<<" "<<K<<endl;
        if (K>=0)
        {
            int tt=0;
            while (!q.empty())
            {
                int u=q.top().se;
                ll w=q.top().fi;
                // cout<<"??"<<u<<","<<w<<'\n';
                q.pop();
                // cout<<"?"<<u<<" "<<w<<" "<<K<<" "<<tt<<" "<<q.size()<<endl;
                if (w!=val[u][vis[u]]||tt==n) continue;
                if (K<w)
                {
                    tt++;
                    if (qs.size()&&K+qs.top().fi-w>=0)
                    {
                        int v=qs.top().se;
                        K+=qs.top().fi-w;
                        vis[v]--;
                        qs.pop();
                        qs.push(mp(val[u][vis[u]],u));
                        vis[u]++;
                        q.push(mp(val[v][vis[v]],v));
                    }
                } else
                {
                    tt=0;
                    // cerr<<"ins "<<u<<" "<<w<<endl;
                    K-=w;
                    qs.push(mp(val[u][vis[u]],u));
                    vis[u]++;
                    if (vis[u]<=1) q.push(mp(val[u][vis[u]],u));
                    now++;
                }
            }
            ans=max(ans,now);
        }
    }
    return ans;
}