#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MAXN = 2 * 1e5 + 10;
const ll MAXK = 1e6 + 10;
const ll INF = 1e18;
ll n, k;
vector<vector<pair<ll, ll>>> tree(MAXN);
ll globalAns = INF;
namespace Centroid
{
ll sz[MAXN], depth[MAXN], best[MAXK];
bool vis[MAXN];
ll maxW = 0;
void findSize(ll node, ll par)
{
sz[node] = 1;
for(const auto& [child, w] : tree[node])
{
if(child == par || vis[child]) continue;
findSize(child, node);
sz[node] += sz[child];
}
}
ll getCentroid(ll node, ll par, ll globalSize)
{
for(const auto& [child, w] : tree[node])
{
if(child == par || vis[child]) continue;
if(sz[child] * 2 > globalSize) return getCentroid(child, node, globalSize);
}
return node;
}
void computeDist(ll node, ll par, ll currDepth, ll currWeight, bool filling)
{
if(currWeight > k) return;
depth[node] = currDepth;
maxW = max(maxW, currWeight);
if(filling)
{
best[currWeight] = min(best[currWeight], depth[node]);
}
else
{
globalAns = min(globalAns, depth[node] + best[k - currWeight]);
}
for(const auto& [child, w] : tree[node])
{
if(child == par || vis[child]) continue;
computeDist(child, node, currDepth + 1, currWeight + w, filling);
}
}
void decompose(ll node)
{
findSize(node, 0);
ll cntr = getCentroid(node, 0, sz[node]);
vis[cntr] = 1;
maxW = 0;
best[0] = 0;
for(const auto& [child, w] : tree[cntr])
{
if(vis[child]) continue;
computeDist(child, cntr, 1, w, false);
computeDist(child, cntr, 1, w, true);
}
fill(best + 1, best + maxW + 1, INF);
for(const auto& [child, w] : tree[cntr])
{
if(vis[child]) continue;
decompose(child);
}
}
void build()
{
fill(best, best + MAXK, INF);
decompose(1);
}
};
int best_path(int N, int K, int H[][2], int L[])
{
n = N;
k = K;
for(ll i = 1 ; i <= n - 1 ; ++i)
{
ll a = H[i][0], b = H[i][1], w = L[i];
tree[a].push_back({b, w});
tree[b].push_back({a, w});
}
Centroid::build();
return (globalAns != INF ? (int)globalAns : -1);
};
/*int main()
{
int n1, k1;
cin >> n1 >> k1;
int h[n1 - 1][2]{0}, l[n1 - 1]{0};
for(int i = 1 ; i <= n1 - 1 ; ++i)
{
cin >> h[i][0] >> h[i][1] >> l[i];
}
cout << best_path(n1, k1, h, l);
}*/
