#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,k;
int a[40005],answer[40005];

vector <int> G[40005];

vector <int> S;
int siz[40005],h[40005],vis[40005],dep[40005],ssum[40005];
void dfs1(int u,int f){
	S.eb(u);
	siz[u] = 1;h[u] = 0;
	for(int v:G[u]){
		if(v == f || vis[v]) continue;
		dfs1(v,u);
		siz[u] += siz[v];
		chkmax(h[u],siz[v]);
	} 
}

int dp[40005][3005],ndp[40005][3005];
void dfs2(int u,int f){
	dep[u] = dep[f] + 1;
	ssum[u] = ssum[f] + a[u];
	per(i,k,1) dp[u][i] = dp[u][i - 1] + a[u];
	dp[u][0] = -inf;

	for(int v:G[u]){
		if(v == f || vis[v]) continue;
		copy(dp[u],dp[u] + k + 1,dp[v]);
		dfs2(v,u);
		rep(i,1,k) chkmax(dp[u][i],dp[v][i]);
	}
}

void dfs3(int u,int f){
	per(i,k,1) ndp[u][i] = ndp[u][i - 1] + a[u];
	ndp[u][0] = -inf;
	rep(i,dep[u],k) chkmax(answer[u],dp[u][i] + ndp[u][k + dep[u] - i] - ssum[u]);

	reverse(G[u].begin(),G[u].end());
	for(int v:G[u]){
		if(v == f || vis[v]) continue;
		copy(ndp[u],ndp[u] + k + 1,ndp[v]);
		dfs3(v,u);
		rep(i,1,k) chkmax(ndp[u][i],ndp[v][i]);
	}
	reverse(G[u].begin(),G[u].end());
}

void solve(int rt){
	S.clear();
	dfs1(rt,0);
	int heavy = rt;
	for(int u:S) if(max(h[u],siz[rt] - siz[u]) <= max(h[heavy],siz[rt] - siz[heavy])) heavy = u;

	if(SZ(S) < k) return;
	fill(dp[heavy],dp[heavy] + k + 1,0);
	fill(ndp[heavy],ndp[heavy] + k + 1,0);
	dfs2(heavy,0);
	dfs3(heavy,0);

	vis[heavy] = 1;
	for(int u:G[rt]) if(!vis[u]) solve(u);
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d%d",&n,&k);
	rep(u,1,n) scanf("%d",&a[u]);
	rep(i,1,n - 1){
		int u,v;
		scanf("%d%d",&u,&v);
		G[u].eb(v);G[v].eb(u);
	}
	solve(1);
	rep(u,1,n) printf("%d ",answer[u]);
	printf("\n");
	return 0;
}