#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
using ll = long long; const int N = 1e5 + 10;
int n, k; ll up[N], dw[N], rs[N], ans;
std::multiset<ll> a, b; std::vector<std::pair<int, int>> g[N];
void ins(ll x){
    if(a.size() < k || *a.begin() < x){
        if(a.size() == k) b.insert(*a.begin()),
            ans -= *a.begin(), a.erase(a.begin());
        ans += x, a.insert(x);
    } else b.insert(x);
}
void del(ll x){
    if(a.find(x) != a.end()){
        ans -= x, a.erase(a.find(x));
        if(b.size()){
            auto it = prev(b.end());
            ans += *it, a.insert(*it), b.erase(it);
        }
    } else b.erase(b.find(x));
}
void dfs(int x, int fa){
    for(auto [v, w] : g[x]) if(v != fa)
        dfs(v, x), dw[x] = std::max(dw[x], dw[v] + w);
}
void dfs1(int x, int fa){
    std::vector<ll> vc(1, 0);
    for(auto [v, w] : g[x]) if(v != fa)
        vc.push_back(dw[v] + w);
    std::sort(vc.begin(), vc.end(), std::greater<>());
    for(int i = 1; i < vc.size(); i++) ins(vc[i]);
    for(auto [v, w] : g[x]) if(v != fa)
        up[v] = std::max(up[x], dw[v]+w==vc[0]?vc[1]:vc[0]) + w, dfs1(v, x);
}
void gt(int x, int fa){
    rs[x] = ans; for(auto [v, w] : g[x]) if(v != fa){
        ins(up[v]), ins(dw[v]), del(up[v] - w), del(dw[v] + w);
        gt(v, x); del(up[v]), del(dw[v]), ins(up[v] - w), ins(dw[v] + w);
    }
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0),std::cout.tie(0);
    std::cin >> n >> k;
    for(int i = 1, x, y, w; i < n; i++)
        std::cin >> x >> y >> w,
        g[x].push_back({y, w}), g[y].push_back({x, w});
    dfs(1, 0); dfs1(1, 0); ins(dw[1]); gt(1, 0);
    for(int i = 1; i <= n; i++) std::cout << rs[i] << '\n';
}