#include <bits/stdc++.h>
#include "race.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
const int maxn = 2e5 + 2;
const int maxk = 1000001;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
//-----------------------------------
int n, k, sz[maxn], done[maxn], ans[maxk], tot=maxk;
vector<pi> adj[maxn];
void getSize(int u, int pre) {
sz[u] = 1;
for (auto it : adj[u]) {
int v=it.F, w=it.S;
if (!done[v] && v != pre) {
getSize(v, u);
sz[u] += sz[v];
}
}
}
int centroid(int u, int pre, int tot) {
for (auto it : adj[u]) {
int v=it.F, w=it.S;
if (v != pre && !done[v] && sz[v]*2 > tot)
return centroid(v, u, tot);
}
return u;
}
void getPaths(int u, int pre, int d, int e, vector<pi> &tmp) {
if (d <= k) {
tot = min(tot, ans[k-d] + e);
tmp.PB({d, e});
}
for (auto it : adj[u]) {
int v=it.F, w=it.S;
if (!done[v] && v != pre)
getPaths(v, u, d+w, e+1, tmp);
}
}
void solve(int u) {
getSize(u, -1);
u = centroid(u, -1, sz[u]);
done[u] = 1;
for (auto it : adj[u]) {
int v=it.F, w=it.S;
vector<pi> tmp;
if (!done[v])
getPaths(v, u, w, 1, tmp);
for (auto it : tmp){
int d=it.F, e=it.S;
ans[d] = min(ans[d], e);
}
}
for (auto it : adj[u]) {
int v=it.F, w=it.S;
if (!done[v]) solve(v);
}
}
/*int main() {
IO();
cin >> n >> k;
for (int u,v,w,i=0; i<n-1; i++) {
cin >> u >> v >> w;
adj[u].PB({v, w}); adj[v].PB({u, w});
}
solve(1);
cout << (tot == maxk ? -1 : tot) << endl;
}*/
int best_path(int n, int k, int H[][2], int L[]){
::n=n; ::k=k;
memset(ans, 0x3f, sizeof ans);
ans[0] = 0;
for (int u,v,w,i=0; i<n-1; i++) {
u = H[i][0], v=H[i][1], w=L[i];
adj[u].PB({v, w}); adj[v].PB({u, w});
}
solve(1);
return (tot == maxk ? -1 : tot);
}
