#include "race.h"
#include <bits/stdc++.h>
#define DEBUG 0
using namespace std;
const int INF = 1e9, MAXN = 2e5+10;
int ans = MAXN;
map<long long, int> mp[MAXN];
vector<pair<int,int>> G[MAXN];
void dfs(int u, int p, int dep, long long d, long long K){
mp[u][d] = dep;
for(auto [v, w] : G[u]){
if(v == p) continue;
dfs(v, u, dep+1, d+w, K);
if(mp[v].size() > mp[u].size()) swap(mp[v], mp[u]);
for(auto &[key, val] : mp[v]){
long long tmp = K-key+2*dep;
if(mp[u].count(tmp)) ans = min(ans, val+mp[u][tmp]-2*dep);
}
for(auto &[key, val] : mp[v]){
if(mp[u].count(key)) mp[u][key] = min(mp[u][key], val);
else mp[u][key] = val;
}
}
if(mp[u].count(K+d)) ans = min(ans, mp[u][K+d]-dep);
}
int best_path(int N, int K, int H[][2], int L[])
{
for(int i = 0; i < N-1; i++){
int u = H[i][0], v = H[i][1];
G[u].emplace_back(v, L[i]);
G[v].emplace_back(u, L[i]);
}
dfs(0, -1, 0, 0, K);
if(ans >= MAXN) ans = -1;
return ans;
}
