#include <bits/stdc++.h>
#define MISAKA main
#define ll long long
using namespace std;
inline int read(){
    char ch=getchar();int f=1,x=0;
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return x*f;
}
const double eps=1e-9;
const int N=40010,K=3010,inf=1e9,mod=998244353;
int n,k,a[N],f[N][K],g[N][K],ans[N],siz[N],id[N],vis[N],tim=0,mn,rt;
vector<int> G[N];
void getsiz(int u,int fa){
    siz[u]=1;
    for(int v:G[u])if(v!=fa&&!vis[v])
        getsiz(v,u),siz[u]+=siz[v];
}
void findrt(int u,int fa,int n){
    int mx=n-siz[u];
    for(int v:G[u])if(v!=fa&&!vis[v])
        findrt(v,u,n),mx=max(mx,siz[v]);
    if(mx<mn) mn=mx,rt=u;
}
void dfs(int u,int fa){id[++tim]=u;for(int v:G[u])if(v!=fa&&!vis[v])dfs(v,u);}
void solve(int u){
    vis[u]=1;tim=0,dfs(u,0);
    for(int i=1;i<=siz[u]+1;i++)
        memset(f[i],-0x3f,sizeof(f[i])),
        memset(g[i],-0x3f,sizeof(g[i]));
    for(int i=0;i<=k;i++) f[1][i]=g[siz[u]+1][i]=0;
    for(int i=1;i<=siz[u];i++){
        for(int j=0;j<k;j++) f[i+1][j+1]=max(f[i+1][j+1],f[i][j]+a[id[i]]);
        for(int j=0;j<k;j++) f[i+siz[id[i]]][j]=max(f[i+siz[id[i]]][j],f[i][j]);
    }
    for(int i=siz[u];i;i--){
        for(int j=0;j<=k;j++) g[i][j]=max(g[i][j],g[i+1][j-1]+a[id[i]]);
        for(int j=0;j<=k;j++) ans[id[i]]=max(ans[id[i]],f[i][j]+g[i][k-j]);
        for(int j=0;j<=k;j++) g[i][j]=max(g[i][j],g[i+siz[id[i]]][j]);
    }
    for(int v:G[u])if(!vis[v]&&siz[v]>=k)
        getsiz(v,0),mn=n+1,findrt(v,0,siz[v]),solve(v);
}
signed MISAKA(){
    n=read(),k=read();
    for(int i=1;i<=n;i++) a[i]=read();
    for(int i=1;i<n;i++){
        int u=read(),v=read();
        G[u].push_back(v);
        G[v].push_back(u);
    }
    getsiz(1,0),mn=n+1,findrt(1,0,n),solve(1);
    for(int i=1;i<=n;i++) printf("%d ",ans[i]);
    return 0;
}