#include <iostream>
#include <cstdio>
#include <cstring>
#define inf 2000000000
using namespace std;
void updmax(int &x,int y){
	if (y>x)x=y;
	return;
}
int n,k,a[40005];
int u[100005],v[100005],first[40005],nxt[100005];
int book[40005];
int sum_sz,sz[40005],rt;
void get_rt(int now,int fa){
	sz[now]=1;
	int mx=0;
	for (int i=first[now];i;i=nxt[i])
		if (v[i]!=fa&&book[v[i]]==0){
			get_rt(v[i],now);
			sz[now]+=sz[v[i]];
			mx=max(mx,sz[v[i]]);
		}
	mx=max(mx,sum_sz-sz[now]);
	if (2*mx<=sum_sz)rt=now;
	return;
}
int f[40005][3005],g[4005][3005];
int ans[40005];
int idx,dfn[40005],nfd[40005],dfo[40005];
int _nxt[40005];
void dfs(int now,int fa){
	++idx;
	dfn[now]=idx;
	nfd[idx]=now;
	for (int i=first[now];i;i=nxt[i])
		if (v[i]!=fa&&book[v[i]]==0)dfs(v[i],now);
	dfo[now]=idx;
	return;
}
void calc(int now){
	book[now]=1;
	idx=0;
	dfs(now,0);
	if (idx<k)return;
	for (int i=1;i<=idx;i++){
		for (int j=0;j<=k;j++)
			f[i][j]=g[i][j]=-inf;
		g[i][0]=0;
		g[i][1]=a[nfd[i]];
	}
	for (int i=1;i<=idx;i++)_nxt[i]=-1;
	for (int i=1;i<=idx;i++){
		int t=dfo[nfd[i]]+1;
		_nxt[i]=t;
	}
	f[1][0]=0;
	for (int i=1;i<=idx;i++)
		for (int j=0;j<k;j++){
			if (i+1<=idx)updmax(f[i+1][j+1],f[i][j]+a[nfd[i]]);
			if (_nxt[i]!=-1){
				updmax(f[_nxt[i]][j],f[i][j]);
				updmax(f[_nxt[i]][j+1],f[i][j]+a[nfd[i]]);
			}
		}
	for (int i=idx;i>=1;i--)
		for (int j=2;j<=k;j++){
			if (i+1<=idx)updmax(g[i][j],g[i+1][j-1]+a[nfd[i]]);
			if (_nxt[i]!=-1){
				updmax(g[i][j],g[_nxt[i]][j]);
				updmax(g[i][j],g[_nxt[i]][j-1]+a[nfd[i]]);
			}
		}
	for (int i=1;i<=idx;i++)
		for (int j=0;j<k;j++){
			int v=a[nfd[i]];
			if (i+1<=idx)updmax(v,g[i+1][k-j-1]+a[nfd[i]]);
			if (_nxt[i]!=-1)updmax(v,g[_nxt[i]][k-j-1]+a[nfd[i]]);
			updmax(ans[nfd[i]],f[i][j]+v);
		}
	get_rt(now,0);
	for (int i=first[now];i;i=nxt[i]){
		if (book[v[i]]==1)continue;
		sum_sz=sz[v[i]],rt=0;
		get_rt(v[i],now);
		calc(rt);
	}
	return;
}
int main(){
	cin>>n>>k;
	for (int i=1;i<=n;i++)cin>>a[i];
	for (int i=1;i<n;i++){
		cin>>u[i]>>v[i];
		nxt[i]=first[u[i]],first[u[i]]=i;
		u[i+n]=v[i],v[i+n]=u[i];
		nxt[i+n]=first[u[i+n]],first[u[i+n]]=i+n;
	}
	calc(1);
	for (int i=1;i<=n;i++)printf("%d ",ans[i]);
	printf("\n");
	return 0;
}