#include <iostream>
#include <vector>
#include <set>

using namespace std;


vector<pair<int, int>> et[50001]; // i - w

//node list[50001];
multiset<int> ol;
//bool ty[500001];

/* index; k hossz; előző csúcs; eddigi path; */
void pf(int i, int k, int l, multiset<int> p) {
	//node *current = &list[i];
	vector<pair<int, int>>* current = &et[i];
	if (p.size() != 0) {
		int c = 0, pb = 0;
		for (int w : p) {
			c++;
			pb = w;
			if (c == int(k / 2)) break;
		}
		//ol.push_back(pb);
		//if(!ty[i])
		ol.insert(pb);
		//ty[i] = 1;
	}

	//if (p.size() == 0) {
	for (pair<int, int> t : *current) {
		if (t.first != l) {
			multiset<int> tp = p; tp.insert(t.second);
			pf(t.first, k + 1, i, tp);
		}
	}
	//}

}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	//#define int long long

	int N;
	long long K;
	cin >> N >> K;


	for (int i = 0, j, t, w; i < N - 1; i++) {
		cin >> j >> t >> w;
		et[j].push_back({ t,w });
		et[t].push_back({ j,w });
	}

	multiset<int> x;
	for (int i = 0; i < N; i++) {
		pf(i + 1, 1, 0, x);
	}
	//cout << "\n" << ol.size() << "\n\n";
	int c = 0, o1 = 0;
	for (int i : ol) {
		//cout << i << "\n";
		c++; o1 = i;
		if (c == K * 2) break;
	}
	cout << o1;

}