#include <bits/stdc++.h>
const int N = 2e5 + 50;
int n, k, tot = 0;
long long f[N], h[N];
bool g[N];
std::vector<std::pair<int, int>> G[N];
void dfs(long long mid, int x, int fa = -1) {
	long long e = 1e18;
	f[x] = 0; h[x] = 1e18;
	std::vector<std::pair<int, int>> son;
	for (auto [y, w] : G[x]) {
		if (y != fa) {
			dfs(mid, y, x);
			//printf("check y = %d, f[y] = %lld, w = %d, h[y] = %lld\n", y, f[y], w, h[y]);
			if (f[y] + w > mid) {
				// set y
				//printf("put %d\n", y);
				h[y] = 0;
				f[y] = -1e18;
				g[y] = 1;
				++tot;
				e = std::min(e, h[y] + w);
			}
			else {
				e = std::min(e, h[y] + w);
			}
		}
	}
	//printf("e = %lld\n", e);
	if (e <= mid) f[x] = -1e18;
	h[x] = e;
	for (auto [y, w] : G[x])
		if (y != fa && !g[y]) {
			if (f[y] + w + e > mid) {
				f[x] = std::max(f[x], f[y] + w);
			}
		}

	//printf("f[%d] = %lld, g[%d] = %d, h[%d] = %lld\n", x, f[x], x, g[x], x, h[x]);
}
bool check(long long mid) {
	memset(f, 0, sizeof f);
	memset(g, 0, sizeof g);
	tot = 0;
	dfs(mid, 1);
	if (f[1] >= 0) {
		assert(!g[1]);
		g[1] = true;
		++tot;
	}
	//printf("mid = %d, tot = %d\n", mid, tot);
	return tot <= k;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	std::cin >> n >> k;
	long long L = 0, R = 0, ans = -1;
	for (int i = 1; i < n; ++i) {
		int x, y, z;
		std::cin >> x >> y >> z;
		G[x].emplace_back(y, z);
		G[y].emplace_back(x, z);
		R += z;
	}
	while (L <= R) {
		long long mid = L + R >> 1;
		if (check(mid)) ans = mid, R = mid - 1;
		else L = mid + 1;
	}
	std::cout << ans << '\n';
	check(ans);
	int tot = 0;
	for (int i = 1; i <= n; ++i)
		if (g[i])
			++tot;
	if (tot < k) {
		for (int i = 1; i <= n; ++i) {
			if (!g[i]) {
				g[i] = 1;
				++tot;
				if (tot == k) break;
			}
		}
	}
	for (int i = 1; i <= n; ++i)
		if (g[i])
			std::cout << i << " ";
	
	std::cout << '\n';
}