#include <bits/stdc++.h>
#include "race.h"
using namespace std;
#define ll int
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
#define vodka void
vector<pair<int,int>>v[1000006];
ll ans = 1e9;
bool vis[200006];
vodka dfs(ll x,queue<int>q,ll cur,int K){
if(vis[x])ertunt;
vis[x] = 1;
if(cur == K)ans = min(ans,(ll)q.size());
while(cur > K){
cur -= q.front();
q.pop();
}
for(auto [z,y] : v[x]){
queue<int> g = q;
g.push(y);
dfs(z,g,cur+y,K);
}
}
int best_path(int N,int K,int H[][2],int L[]){
for(ll i = 0; i < N-1; i++){
v[H[i][0]].pb({H[i][1],L[i]});
v[H[i][1]].pb({H[i][0],L[i]});
}
vector<int>d;
for(ll i = 0; i < N; i++){
if(v[i].size() == 1)d.pb(i);
}
for(auto i : d){
queue<int>f;
dfs(i,f,0,K);
fill(vis,vis+N+5,0);
}
ertunt ans;
}
