#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
int Read() {
    int x = 0, f = 1; char ch = getchar();
    while(!isdigit(ch) && ch != '-')  ch = getchar();
    if(ch == '-')  f = -1, ch = getchar();
    while(isdigit(ch))  x = x * 10 + ch - '0', ch = getchar();
    return x * f;  
}
int first[5005], nxt[5005], to[5005], vis[5005], w[5005], tot = 1, dd[5005];
void Add(int x, int y, int z) {
    nxt[++tot] = first[x]; first[x] = tot; to[tot] = y, w[tot] = z, dd[tot] = x;
    nxt[++tot] = first[y]; first[y] = tot; to[tot] = x, w[tot] = z, dd[tot] = y;
}
int n, k, mx[2005][4], mpos[2005][4], chans[2005][3], chmpos[2005][3], ans[2005], zj[2005];
void upd(int u, int val, int pos) {
    // cout << u << " " << pos << endl;
    if(mx[u][1] < val || mpos[u][1] == -1)
        mx[u][3] = mx[u][2], mpos[u][3] = mpos[u][2], 
        mx[u][2] = mx[u][1], mpos[u][2] = mpos[u][1], 
        mx[u][1] = val, mpos[u][1] = pos;
    else if(mx[u][2] < val || mpos[u][2] == -1)
        mx[u][3] = mx[u][2], mpos[u][3] = mpos[u][2],
        mx[u][2] = val, mpos[u][2] = pos;
    else if(mx[u][3] < val || mpos[u][3] == -1)
        mx[u][3] = val, mpos[u][3] = pos;
}
void updans(int u, int val, int pos) {
    if(chans[u][1] < val || chmpos[u][1] == -1)
        chans[u][2] = chans[u][1], chmpos[u][2] = chmpos[u][1], 
        chans[u][1] = val, chmpos[u][1] = pos;
    else if(chans[u][2] < val || chmpos[u][2] == -1)
        chans[u][2] = val, chmpos[u][2] = pos;
}
void dfs(int u, int fa) {
    for(int e = first[u]; e; e = nxt[e]) {
        int v = to[e];
        if(v == fa || vis[e])  continue ;
        dfs(v, u);
        if(mpos[v][1] == -1)  upd(u, w[e], v);
        else  upd(u, mx[v][1] + w[e], v);
        updans(u, ans[v], v);
    }
    ans[u] = max(chans[u][1], mx[u][1] + mx[u][2]);
}
int mxedg = -1, mxval;
void dfs2(int u, int fa, int ww) {
    if(u != fa) {
        int s1 = ans[u];
        int chansf = (chmpos[fa][1] == u) ? chans[fa][2] : chans[fa][1];
        int num = 0, mxf = 0;
        for(int i = 1; i <= 3; i++) {
            if(mpos[fa][i] != u && num < 2)
                ++num, mxf += mx[fa][i];
        }
        int s2 = max(mxf, chansf);
        if(s2 + s1 + w[ww] > mxval)
            mxval = s2 + s1 + w[ww], mxedg = ww, zj[u] = s1, zj[fa] = s2;
        int s3 = (mpos[fa][1] == u) ? mx[fa][2] + w[ww] : mx[fa][1] + w[ww];
        upd(u, s3, fa); updans(u, s2, fa);
        // cout << u << " " << s1 << " " << s2 << " " << s3 << " " << w[ww] << endl;
    }
    for(int e = first[u]; e; e = nxt[e]) {
        int v = to[e];
        if(vis[e] || v == fa)  continue ;
        dfs2(v, u, e);
    }
}
signed main() {
    n = Read(), k = Read();
    for(int i = 1; i < n; i++) {
        int x = Read(), y = Read(), z = Read();
        Add(x, y, z);
    }
    memset(mpos, -1, sizeof(mpos));
    memset(chmpos, -1, sizeof(chmpos));
    dfs(1, 0);
    int Ans = ans[1];
    cout << Ans << " ";
    priority_queue<pair<int, int> > q;
    dfs2(1, 1, 0);
    q.push(make_pair(mxval - Ans, mxedg));
    for(int i = 1; i <= k; i++) {
        pair<int, int> u = q.top(); q.pop();
        Ans = Ans + u.first;
        cout << Ans << " ";
        int ww = u.second;
        vis[ww] = vis[ww ^ 1] = 1;
        int z1 = zj[dd[ww]], z2 = zj[dd[ww ^ 1]];
//        cout << dd[ww] << " " << dd[ww ^ 1] << endl;
        memset(mpos, -1, sizeof(mpos));
        memset(chmpos, -1, sizeof(chmpos));
        memset(mx, 0, sizeof(mx));
        memset(chans, 0, sizeof(chans));
        memset(ans, 0, sizeof(ans));
        mxedg = -1, mxval = 0;
        dfs(dd[ww], 0);
        dfs2(dd[ww], dd[ww], 0);
        if(mxedg != -1)  q.push(make_pair(mxval - z1, mxedg));
        ww ^= 1;
        memset(mpos, -1, sizeof(mpos));
        memset(chmpos, -1, sizeof(chmpos));
        memset(mx, 0, sizeof(mx));
        memset(chans, 0, sizeof(chans));
        memset(ans, 0, sizeof(ans));
        mxedg = -1, mxval = 0;
        dfs(dd[ww], 0);
        dfs2(dd[ww], dd[ww], 0);
        if(mxedg != -1)  q.push(make_pair(mxval - z2, mxedg));
    }
    return 0;
}