#include <bits/stdc++.h>
using i64 = long long;
#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) void(23)
#endif
int N, K;
std::vector<std::vector<int>> adj;
std::vector<std::array<int, 3>> E;
std::vector<i64> dep;
int dfs(int v, int pr) {
if (int(adj[v].size()) == 1 && v != pr) { // leaf
return v;
}
std::pair<i64, int> mx = {-1, 0};
for (auto i : adj[v]) {
int u = E[i][0] ^ E[i][1] ^ v;
if (u == pr) {
continue;
}
int x = dfs(u, v);
dep[x] += E[i][2];
mx = std::max(mx, {dep[x], x});
}
return mx.second;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> N >> K;
adj.resize(N);
E.resize(N);
for (int i = 1; i < N; ++i) {
int A, B, C;
std::cin >> A >> B >> C;
--A, --B;
E[i] = {A, B, C};
adj[A].emplace_back(i);
adj[B].emplace_back(i);
}
for (int i = 0; i < N; ++i) {
dep.assign(N, 0);
dfs(i, i);
std::sort(dep.begin(), dep.end(), std::greater());
i64 ans = 0;
for (int j = 0; j < K; ++j) {
ans += dep[j];
}
std::cout << ans << '\n';
}
return 0;
}
