#include <bits/stdc++.h>
#include "race.h"
#define lowb(a, r, x) lower_bound(a + 1, a + r + 1, x) - a
#define uppb(a, r, x) upper_bound(a + 1, a + r + 1, x) - a
#define _for(i, a, b) for (ll i = a; i <= b; ++i)
#define for_(i, a, b) for (ll i = a; i >= b; --i)
#define far(i, vec) for (auto i : vec)
#define bdmd ll mid = (l + r) >> 1
#define NO nullptr
typedef long double ldb;
typedef long long ll;
typedef double db;
typedef std::pair <ll, ll> pll;
const ll N = 2e5 + 10, K = 1e6 + 10, inf = 1ll << 60;
namespace SOLVE {
	ll n, k, root, sz[N], mx[N], len[K], ans;
	std::vector <pll> tu[N], tmp;
	bool vis[N];
	inline ll rnt () {
		ll x = 0, w = 1; char c = getchar ();
		while (!isdigit (c)) { if (c == '-') w = -1; c = getchar (); }
		while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
		return x * w;
	}
	void GetDis (ll u, ll fa, ll s, ll d) {
		if (s > k) return;
		tmp.emplace_back (s, d);
		far (p, tu[u]) {
			ll v = p.first, w = p.second;
			if (vis[v] || v == fa) continue;
			GetDis (v, u, s + w, d + 1);
		}
		return;
	}
	void Clear (ll u, ll fa, ll s, ll d) {
		if (s > k) return;
		len[s] = inf;
		far (p, tu[u]) {
			ll v = p.first, w = p.second;
			if (vis[v] || v == fa) continue;
			Clear (v, u, s + w, d + 1);
		}
		return;
	}
	inline void Calc (ll u) {
		len[0] = 0;
		far (p, tu[u]) {
			ll v = p.first, w = p.second;
			if (vis[v]) continue;
			GetDis (v, u, w, 1);
			far (j, tmp) {
				ll t = k - j.first;
				if (len[t] < inf) ans = std::min (ans, len[t] + j.second);
			}
			far (j, tmp) len[j.first] = std::min (len[j.first], j.second);
			std::vector <pll> ().swap (tmp);
		}
		Clear (u, 0, 0, 0);
		return;
	}
	void GetRoot (ll u, ll fa) {
		sz[u] = 1, mx[u] = 0;
		far (p, tu[u]) {
			ll v = p.first, w = p.second;
			if (vis[v] || v == fa) continue;
			GetRoot (v, u), sz[u] += sz[v];
			mx[u] = std::max (mx[u], sz[v]);
		}
		mx[u] = std::max (mx[u], sz[0] - sz[u]);
		if (mx[u] < mx[root]) root = u;
		return;
	}
	void Divide (ll u) {
		Calc (u);
		vis[u] = true;
		far (p, tu[u]) {
			ll v = p.first, w = p.second;
			if (vis[v]) continue;
			sz[0] = sz[v], mx[root = 0] = inf;
			GetRoot (v, u);
			Divide (root);
		}
		return;
	}
	inline void In (int N, int K, int H[][2], int L[]) {
		n = N, k = K;
		_for (i, 1, n - 1) {
			ll u = H[i][0] + 1, v = H[i][1] + 1, w = L[i];
			tu[u].emplace_back (v, w);
			tu[v].emplace_back (u, w);
		}
		return;
	}
	inline void Solve () {
		ans = inf, sz[0] = n, mx[root = 0] = inf;
		_for (i, 1, k) len[i] = inf;
		GetRoot (1, 0);
		Divide (root);
		return;
	}
	inline void Out () {
		printf ("%lld\n", ans == inf ? -1 : ans);
		return;
	}
}
int best_path(int N, int K, int H[][2], int L[]) {
	SOLVE::In (N, K, H, L);
	SOLVE::Solve ();
	return SOLVE::ans == inf ? -1 : SOLVE::ans;
}