#include <bits/stdc++.h>
using namespace std;
int n, k;
int c[200005];
vector<int> g[200005];
long long ans[200005], val[200005], dp[200005][2];
long long sum, most, all;
multiset<long long> s1, s2;
void add(long long x) {
    if (x == 0) return;
    s1.insert(x);
    most += x;
    if (s1.size() > k) {
        x = *s1.begin();
        most -= x;
        s2.insert(x);
        s1.erase(s1.find(x));
    }
}
void del(long long x) {
    if (x == 0) return;
    if (s1.find(x) != s1.end()) {
        s1.erase(s1.find(x));
        most -= x;
        if (!s2.empty()) {
            long long now = *s2.rbegin();
            most += now;
            s1.insert(now);
            s2.erase(s2.find(now));
        }
    } else {
        s2.erase(s2.find(x));
    }
}
void dfs(int x, int fa) {
    val[x] = c[x];
    dp[x][0] = dp[x][1] = 0;
    for (int v : g[x]) {
        if (v == fa) continue;
        dfs(v, x);
        val[x] += val[v];
        if (dp[v][0] + val[v] > dp[x][1]) {
            add(dp[x][1]);
            dp[x][1] = dp[v][0] + val[v];
            if (dp[x][1] > dp[x][0]) swap(dp[x][0], dp[x][1]);
        } else {
            add(dp[v][0] + val[v]);
        }
    }
    add(dp[x][1]);
}
void dfs2(int x, int fa, long long now) {
    ans[x] = sum - most;
    for (int v : g[x]) {
        if (v == fa) continue;
        sum = sum - val[v] + all - val[v];
        long long tmp;
        del(dp[v][0] + val[v]);
        add(dp[v][0]);
        if (dp[x][0] == dp[v][0] + val[v]) {
            tmp = dp[x][1];
        } else {
            tmp = dp[x][0];
        }
        tmp = max(tmp, now);
        del(tmp);
        tmp = tmp + (all - val[v]);
        add(tmp);
        dfs2(v, x, tmp);
        del(tmp);
        tmp = tmp - (all - val[v]);
        add(tmp);
        del(dp[v][0]);
        add(dp[v][0] + val[v]);
        sum = sum - (all - val[v]) + val[v];
    }
}
void solve() {
    cin >> n >> k;

    all = 0;
    for (int i = 1; i <= n; ++i) cin >> c[i], all += c[i];
    for (int i = 1; i < n; ++i) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    sum = 0;
    most = 0;
    k = min(k, n);

    dfs(1, 0);
    add(dp[1][0]);
    for (int i = 2; i <= n; ++i) sum += val[i];

    dfs2(1, 0, 0);
    for (int i = 1; i <= n; ++i) cout << ans[i] << endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}