#include "race.h"
#include <vector>
#include <queue>
#include <iostream>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
const int N = 200001;
int res = -1;
int att[N];
int biju[N];
int len[N];
vector<vector<pair<int,int>>> g(N);
void DFS(int v1, int k, int currres){
if(!(att[v1] < k || res == -1 || len[v1]<currres ))
return;
for(auto p : g[v1]){
if(!biju[p.second]){
biju[p.second] = 1;
att[p.second] = att[v1] + p.first;
len[p.second] = len[v1] + 1;
if(att[p.second] < k || res == -1 || len[p.second]<currres)
DFS(p.second, k, currres);
}
}
}
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], w = L[i];
g[u].push_back({w, v});
g[v].push_back({w, u});
}
//cout << "test";
for(int i = 0; i < N; i++){
//fill(att,att+N, 0);
fill(biju,biju+N, 0);
att[i] = len[i] = 0;
biju[i] = 1;
DFS(i, K, res);
for(int j = 0;j < N;j++){
if(att[j] == K && (res == -1 || len[j] < res))
res = len[j];
}
}
//cout << res/2;
return res;
}
