#include <bits/stdc++.h>
using namespace std;
// Do you think you'll ever remember me someday, or will I just fade away from your memory?
#define LIFESUCK ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define str string
#define mll map<ll, ll>
#define vll vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define all(c) c.begin(), c.end()
#define pb push_back
#define debug cout << "I Love You\n";
#define fu(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, b, a) for (int i = b; i >= a; i--)
#define Bitc(msk, j) ((msk >> j) & 1)
#define _log(x) 31 - __builtin_clz(x)
const ll Mod = 1e9 + 7;
const ll inf = (1ll << 30);
const ll lnf = (1ll << 60);
// When time passes and things change... will you still remember someone like me?
int64_t add(ll &a, ll b) {
a += b;
if (a >= Mod) a %= Mod;
while (a < 0) a += Mod;
return a;
}
int64_t mul(ll a, ll b) {
a = 1ll * a * b % Mod;
return a;
}
template <class X, class Y>
bool minimize(X &x, Y y) {
X eps = 1e-9;
if (x > y + eps) {
x = y;
return 1;
}
return 0;
}
template <class X, class Y>
bool maximize(X &x, Y y) {
X eps = 1e-9;
if (x + eps < y) {
x = y;
return 1;
}
return 0;
}
// I wonder… will I just become a distant memory to you one day?
#define mxn 200'007
ll n, k, g[mxn];
vector<pll> graph[mxn];
struct Edge {
ll u, v, w;
} edge[mxn];
namespace Love1 {
bool check () {
return (n <= 20);
}
struct EdgePrio {
ll d, u;
bool operator < ( const EdgePrio& other ) const {
return other.d > d;
}
};
ll f[27];
void DreamyLove () {
ll sad = lnf, gf;
fu(msk, 0, (1 << n) - 1) {
if(__builtin_popcount(msk) != k) continue;
priority_queue<EdgePrio> Q;
fu(i, 1, n) f[i] = lnf;
fu(j, 0, n - 1) if(Bitc(msk, j)) Q.push({0, j + 1}), f[j + 1] = 0;
ll cr = -lnf;
while(!Q.empty()) {
auto[d, u] = Q.top();Q.pop();
if ( d > f[u] ) continue;
for(pll& it: graph[u]){
ll v = it.fi, w = it.se;
if (f[v] <= f[u] + w) continue;
f[v] = f[u] + w;
Q.push({f[v], v});
}
}
fu(i, 1, n) maximize(cr, f[i]);
if(minimize(sad, cr)) gf = msk;
}
cout << sad << '\n';
fu (j, 0, n - 1 ) if (Bitc( gf, j)) cout << j + 1 << ' ';
//
}
}
void lovesper(const ll &TestCase) {
cin >> n >> k;
fu(i, 2, n) {
ll u, v, w; cin >> u >> v >> w;
graph[u].pb({v, w});
graph[v].pb({u, w});
edge[i] = {u, v, w};
}
if(Love1::check()) {
Love1::DreamyLove();
return;
}
}
signed main() {
LIFESUCK
#define name "lovesper"
// freopen(name".inp", "r", stdin);
// freopen(name".out", "w", stdout);
ll Test = 1;
// cin >> Test;
fu(i, 1, Test) {
lovesper(i);
if (i < Test) cout << '\n';
}
return 0;
}
