#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=4e4+5;

static char buf[1000000],*p1=buf,*p2=buf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++
inline int wrd(){int x=0,f=1;char c=getchar();while(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+c-48;c=getchar();}return x*f;}
inline void write(ll x){static char buf[20];static int len=-1;if(x<0)putchar('-'),x=-x;do buf[++len]=x%10,x/=10;while(x);while(len>=0)putchar(buf[len--]+48);}

int n,m,a[N];
int rt,dfn[N],mp[N],dfn2[N],mp2[N],tot,idx;
int sz[N],mx[N],dep[N];
ll h[N];
bool vs[N];
vector<int> e[N];

void DFS(int u,int fa,int tt){
	sz[u]=1,mx[u]=0;
	dep[u]=dep[fa]+1,h[u]=h[fa]+a[u];
	dfn[u]=++tot,mp[tot]=u;
	for(int v:e[u]){
		if(v==fa || vs[v]) continue;
		DFS(v,u,tt),sz[u]+=sz[v],mx[u]=max(mx[u],sz[v]);
	}
	dfn2[u]=++idx,mp2[idx]=u;
	mx[u]=max(mx[u],tt-sz[u]);
	if(mx[u]<mx[rt]) rt=u;
}

ll as[N],f[N][3005],g[N][3005];

void dfs(int u){
	// cout << u << endl;
	vs[u]=1;
	if(sz[u]<m) return;
	// calculate answer of root u
	for(int i=0;i<=tot+1;++i) for(int j=0;j<=m;++j) f[i][j]=g[i][j]=0;
	for(int i=tot;i;--i){
		int u=mp[i];
		for(int j=1;j<=m;++j)
			f[i][j]=max(f[i][j],f[i+1][j-1]+a[u]);
		for(int j=1;j<=m;++j)
			f[i][j]=max(f[i][j],f[i+sz[u]][j]);
	}
	for(int i=1;i<=tot;++i){
		int u=mp2[i];
		for(int j=1;j<=m;++j)
			g[i][j]=max(g[i][j],g[i-1][j-1]+a[u]);
		for(int j=1;j<=m;++j)
			g[i][j]=max(g[i][j],g[i-sz[u]][j]);
	}
	
	for(int i=1;i<=tot;++i){
		int u=mp[i];
		for(int j=0;j<=m-dep[u];++j){
			as[u]=max(as[u],f[i+1][j]+g[dfn2[u]-sz[u]][m-dep[u]-j]+h[u]);
		}
	}
	
	for(int v:e[u]){
		if(vs[v]) continue;
		rt=tot=idx=0,DFS(v,0,sz[v]),dfs(v);
	}
}

signed main(){
	n=wrd(),m=wrd();
	for(int i=1;i<=n;++i) a[i]=wrd();
	for(int i=1;i<n;++i){
		int u=wrd(),v=wrd();
		e[u].push_back(v),e[v].push_back(u);
	}
	mx[0]=n;
	DFS(1,0,n),tot=idx=0,DFS(rt,0,n);
	dfs(rt);
	for(int i=1;i<=n;++i) write(as[i]),putchar(' ');
	return 0;
}