#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <unordered_map>
using namespace std;
#define fi first
#define sc second
#define mkp make_pair
#define pii pair<int,int>
typedef long long ll;
const int N=40005,K=3005,oo=1e9,bas=131,mod=1e9+9;
inline int read() {
    int x=0,flag=0;char ch=getchar();
    while(ch<'0'||ch>'9') {flag|=(ch=='-');ch=getchar();}
    while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return flag?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}
inline void swp(int &x,int &y) {x^=y^=x^=y;}
inline int as(int x) {return x>0?x:-x;}
inline void ckmax(int&x,int y) {x=mx(x,y);}

int n,k,a[N],hd[N],num;
struct node {
    int nxt,to;
}e[N<<1];
#define v e[i].to
inline void adde(int x,int y) {
    e[++num]=(node){hd[x],y};
    hd[x]=num;
}
int tot,rt,maxp[N],sz[N];bool vis[N];
void getrt(int x,int fa) {
    sz[x]=1; maxp[x]=0;
    for(int i=hd[x];i;i=e[i].nxt) {
        if(v==fa||vis[v]) continue;
        getrt(v,x);
        sz[x]+=sz[v];
        maxp[x]=mx(maxp[x],sz[v]);
    }
    maxp[x]=mx(maxp[x],tot-sz[x]);
    if(maxp[x]<maxp[rt]) rt=x;
}
int dfn[N],rev[N],ans[N],to[N],To[N],f[N][K],g[N][K],g_[N][K];
vector<int> T[N],G[N];
void Dfs(int x,int fa) {
    sz[x]=1; dfn[x]=++dfn[0]; rev[dfn[0]]=x;
    for(int i=hd[x];i;i=e[i].nxt) {
        if(v==fa||vis[v]) continue;
        Dfs(v,x);
        sz[x]+=sz[v];
    }
    to[dfn[x]]=dfn[x]+1; To[dfn[x]]=dfn[x]+sz[x];
    T[to[dfn[x]]].push_back(dfn[x]);
    G[To[dfn[x]]].push_back(dfn[x]);
}
inline void work(int x) {
    dfn[0]=0;
    Dfs(x,0);
    if(sz[x]<k) return ;
    for(int i=1;i<=sz[x];++i)
        for(int j=0;j<=k;++j)
            f[i][j]=-oo,g[i][j]=g_[i][j]=0;
    f[1][0]=0;
    for(int i=1;i<=sz[x];++i) {
        for(int j=0;j<k;++j)
            ckmax(f[to[i]][j+1],f[i][j]+a[rev[i]]),
            ckmax(f[To[i]][j],f[i][j]);
    }
    g[sz[x]][1]=g_[sz[x]][1]=a[rev[sz[x]]];
    for(int i=sz[x];i>=1;--i) {
        for(int j=0;j<k;++j) {
            for(int&V:T[i])
                ckmax(g[V][j+1],g[i][j]+a[rev[V]]),
                ckmax(g_[V][j+1],g[i][j]+a[rev[V]]);
            for(int&V:G[i])
                ckmax(g[V][j],g[i][j]);
        }
    }
    for(int i=1;i<=sz[x];++i)
        for(int j=0;j<k;++j)
            ckmax(ans[rev[i]],f[i][j]+g_[i][k-j]);
    for(int i=0;i<=sz[x]+1;++i) T[i].clear(),G[i].clear();
}
inline void solve(int x) {
    work(x); vis[x]=1;
    for(int i=hd[x];i;i=e[i].nxt) {
        if(vis[v]) continue;
        tot=sz[v]; maxp[rt=0]=oo;
        getrt(v,0); getrt(rt,0);
        solve(rt);
    }
}
int main() {
    n=read();k=read();
    for(int i=1;i<=n;++i) a[i]=read();
    for(int i=1,x,y;i<n;++i) {
        x=read();y=read();
        adde(x,y);adde(y,x);
    }
    tot=n; maxp[rt=0]=oo;
    getrt(1,0);
    solve(rt);
    for(int i=1;i<=n;++i) printf("%d ",ans[i]);
    return 0;
}