// sis puella oier
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
ll read(){
    ll xx = 0, f = 1; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar())
        xx = (xx << 3) + (xx << 1) + ch - '0';
    return xx * f;
}
const int N = 40010, M = 3010, inf = 2e9;
int n, k, a[N];
vector <int> e[N];
bool vis[N];
int siz[N], mx[N], rt, tot;
int ans[N];
void getrt(int x, int fa){
    siz[x] = 1, mx[x] = 0;
    for (int v : e[x])if (v != fa && !vis[v])
        getrt(v, x), siz[x] += siz[v], mx[x] = max(mx[x], siz[v]);
    mx[x] = max(mx[x], tot - siz[x]);
    if (mx[x] < mx[rt])rt = x;
}
int f[N][M], g[N][M], dep[N], dis[N];
void init(int x, int fa){
    dep[x] = dep[fa] + 1, dis[x] = dis[fa] + a[x];
    for (int i = 1; i <= k; ++i)f[x][i] = -inf;
    for (int v : e[x])if (v != fa && !vis[v])init(v, x);
}
void dfs(int x, int fa, int o){
    if (o == 0){
        for (int i = 1; i <= k; ++i)g[x][i] = f[x][i];
        for (int i = 0, v; i < e[x].size(); ++i){
            v = e[x][i]; if (v == fa || vis[v])continue;
            for (int j = 1; j < k; ++j)if (f[x][j] != inf)
                f[v][j + 1] = max(f[v][j + 1], f[x][j] + a[v]);
            dfs(v, x, o);
        }
        for (int i = 1; i <= k; ++i)f[fa][i] = max(f[fa][i], f[x][i]);
    }
    else {
        for (int i = (int)e[x].size() - 1, v; i >= 0; --i){
            v = e[x][i]; if (v == fa || vis[v])continue;
            for (int j = 1; j < k; ++j)if (f[x][j] != inf)
                f[v][j + 1] = max(f[v][j + 1], f[x][j] + a[v]);
            dfs(v, x, o);
        }
        for (int i = 1; i <= k; ++i)f[fa][i] = max(f[fa][i], f[x][i]);
        for (int i = dep[x]; i <= k; ++i)if (g[x][i] != -inf)
            for (int j = dep[x]; j - dep[x] <= k - i; ++j)if (f[x][j] != -inf)
                ans[x] = max(ans[x], g[x][i] + f[x][j] - dis[x]);
    }
}
void divide(int x){
    // cout<<x<<endl;
    dep[x] = dis[x] = 0, init(x, x); f[x][1] = a[x]; dfs(x, x, 0);
    dep[x] = dis[x] = 0, init(x, x); f[x][1] = a[x]; dfs(x, x, 1);
    // return ;
    getrt(x, x); vis[x] = true;
    for (int v : e[x])if (!vis[v])
        tot = siz[v], rt = 0, getrt(v, v), divide(rt);
}
signed main(){
    n = read(), k = read();
    for (int i = 1; i <= n; ++i)a[i] = read();
    for (int i = 1, u, v; i < n; ++i)u = read(), v = read(),
    e[u].push_back(v), e[v].push_back(u);
    mx[0] = n, tot = n, rt = 0; getrt(1, 1); divide(rt);
    for (int i = 1; i <= n; ++i)printf("%d ", ans[i]); printf("\n");
    return 0;
}