#include <bits/stdc++.h>
#define ri register int
#define ll long long
#define fi first
#define se second
using namespace std;
const int Maxn=4e4;
const int Maxm=3e3;
const int Inf=2e9;
vector<int>adj[Maxn+5];
int a[Maxn+5];
int f[Maxn+5][Maxm+5],g[Maxn+5][Maxm+5];
int pre[Maxn+5],suf[Maxn+5],in_pre[Maxn+5],in_suf[Maxn+5],t_pre,t_suf;
int ans[Maxn+5];
int vis[Maxn+5],size[Maxn+5];
vector<pair<int,int>>s;
int n,k;
void dfs(int u,int fa,int n) {
	size[u]=1;
	int mx=0;
	for(auto v:adj[u]) {
		if(v!=fa&&!vis[v]) {
			dfs(v,u,n);
			size[u]+=size[v];
			mx=max(mx,size[v]);
		}
	}
	s.emplace_back(max(mx,n-size[u]),u);
}
void dfs1(int u,int fa) {
	size[u]=1;
	pre[++t_pre]=u,in_suf[u]=t_suf+1,in_pre[u]=t_pre;
	for(auto v:adj[u]) {
		if(v!=fa&&!vis[v]) {
			dfs1(v,u);
			size[u]+=size[v];
		}
	}
	suf[++t_suf]=u;
}
void dfs2(int u,int fa,int dep,int sum) {
	int need=k-dep;
	for(ri i=0;i<=need;i++) {
		ans[u]=max(ans[u],g[in_suf[u]-1][i]+f[in_pre[u]+1][need-i]+sum);
	}
	for(auto v:adj[u]) {
		if(v!=fa&&!vis[v]) {
			dfs2(v,u,dep+1,sum+a[v]);
		}
	}
}
void work(int u) {
	if((int)s.size()<k)return ;
	dfs1(u,0);
	for(ri i=1;i<=k;i++)f[n+1][i]=g[0][i]=-Inf;
	f[n+1][0]=0,g[0][0]=0;
	for(ri i=n;i>=1;i--) {
		int u=pre[i];
		for(ri j=0;j<=k;j++) {
			f[i][j]=f[i+size[u]][j];
			if(j) {
				f[i][j]=max(f[i][j],f[i+1][j-1]+a[u]);
			}
		}
	}
	for(ri i=1;i<=n;i++) {
		int u=suf[i];
		for(ri j=0;j<=k;j++) {
			g[i][j]=g[i-size[u]][j];
			if(j) {
				g[i][j]=max(g[i][j],g[i-1][j-1]+a[u]);
			}
		}
	}
	dfs2(u,0,1,a[u]);
}
void solve(int u,int n) {
	dfs(u,0,n);
	int p=min_element(s.begin(),s.end())->se;
	work(p);
	s.clear();
	vis[p]=1;
	for(auto v:adj[p]) {
		if(!vis[v]) {
			solve(v,size[v]<size[p]?size[v]:n-size[p]);
		}
	}
}
int main() {
	scanf("%d%d",&n,&k);
	for(ri i=1;i<=n;i++)scanf("%d",&a[i]);
	for(ri i=1;i<n;i++) {
		int x,y;
		scanf("%d%d",&x,&y);
		adj[x].emplace_back(y);
		adj[y].emplace_back(x);
	}
	solve(1,n);
	for(ri i=1;i<=n;i++)printf("%d ",ans[i]);
	puts("");
	return 0;
}