#include "race.h"
#include <bits/stdc++.h>
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
#define NL(x) " \n"[(x)]
#define lld long long
#define pil pair<int,lld>
#define pli pair<lld,int>
#define pll pair<lld,lld>
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 200010
#define MAXK 1000010
vector<pii> adj[MAXN];
int N, K, siz[MAXN], res, b[MAXK];
bool vis[MAXN];
int dfsSize(int node, int prev) {
siz[node] = 1;
for(auto x : adj[node]) {
if(x.fi != prev && !vis[x.fi]) siz[node] += dfsSize(x.fi, node);
}
return siz[node];
}
int dfsCentroid(int node, int prev, int S) {
for(auto x : adj[node]) {
if(x.fi != prev && !vis[x.fi] && siz[x.fi] > S/2) return dfsCentroid(x.fi, node, S);
}
return node;
}
vector<int> v;
vector<pii> vt;
void dfsSolve(int node, int prev, int len, int dub) {
vt.pb({dub, len});
v.pb(len);
res = min(res, b[K-len]+dub);
for(auto x : adj[node]) {
if(x.fi != prev && !vis[x.fi] && len+x.se <= K) dfsSolve(x.fi, node, len+x.se, dub+1);
}
}
void centroidDecomp(int node) {
int S = dfsSize(node, node);
node = dfsCentroid(node, node, S);
vis[node] = 1;
for(auto x : adj[node]) {
if(!vis[x.fi] && x.se <= K) dfsSolve(x.fi, node, x.se, 1);
for(auto y : vt) {
b[y.se] = min(b[y.se], y.fi);
}
res = min(res, b[K]);
vt.clear();
}
for(auto x : v) b[x] = N;
v.clear();
for(auto x : adj[node]) if(!vis[x.fi]) centroidDecomp(x.fi);
}
int best_path(int n, int k, int H[][2], int L[]) {
N = n; K = k;
for(int i = 0; i < N-1; i++) {
adj[H[i][0]+1].pb({H[i][1]+1, L[i]});
adj[H[i][1]+1].pb({H[i][0]+1, L[i]});
}
res = N;
for(int i = 0; i <= K; i++) b[i] = N;
centroidDecomp(1);
return (res == N ? -1:res);
}
/*
4 3
0 1 1
1 2 2
1 3 4
2
3 3
0 1 1
1 2 1
-1
11 12
0 1 3
0 2 4
2 3 5
3 4 4
4 5 6
0 6 3
6 7 2
6 8 5
8 9 6
8 10 7
2
*/
