#include<bits/stdc++.h>

using namespace std;

const int N = 4e4 + 5, K = 3000 + 5;
int n = 0, k = 0, tag[N] = {}, a[N] = {}, f[N][K] = {}, g[N][K] = {}, ans[N] = {};
int m = 0, siz[N] = {};
vector<vector<int> > G(N);
vector<int> V;

inline void dfs1(int u, int p = 0){
	siz[u] = 1, m ++;
	for(int v : G[u]) if(!tag[v] && v != p){
		dfs1(v, u);
		siz[u] += siz[v];
	}
}

inline int dfs2(int u, int p = 0){
	for(int v : G[u]) if(!tag[v] && v != p) if(2 * siz[v] > m) return dfs2(v, u);
	return u;
}

inline void dfs3(int u, int p = 0){
	siz[u] = 1, V.push_back(u);
	for(int v : G[u]) if(!tag[v] && v != p){
		dfs3(v, u);
		siz[u] += siz[v];
	}
}

inline void calc(){
	for(int i = 0 ; i <= m ; i ++) memset(f[i], 0xa0, sizeof(f[i])), memset(g[i], 0xa0, sizeof(g[i]));
	f[0][0] = 0, g[m][0] = 0;
	for(int i = 0 ; i < m ; i ++){
		int s = siz[V[i]], w = a[V[i]];
		for(int x = 0 ; x <= k ; x ++){
			f[i + 1][x + 1] = max(f[i + 1][x + 1], f[i][x] + w);
			f[i + s][x] = max(f[i + s][x], f[i][x]);
		}
	}
	for(int i = m - 1 ; i >= 0 ; i --){
		int s = siz[V[i]], w = a[V[i]];
		for(int x = 0 ; x <= k ; x ++){
			g[i][x + 1] = max(g[i][x + 1], g[i + 1][x] + w);
			g[i][x] = max(g[i][x], g[i + s][x]);
		}
	}
	for(int i = 0 ; i < m ; i ++) for(int x = 0 ; x < k ; x ++) if(f[i][x] >= 0 && g[i + 1][k - 1 - x] >= 0)ans[V[i]] = max(ans[V[i]], f[i][x] + g[i + 1][k - 1 - x] + a[V[i]]);
}

inline void cdq(int r){
	m = 0, dfs1(r);
	if(m < k) return;
	r = dfs2(r);
	V.clear(), dfs3(r);
	calc();
	tag[r] = 1; for(int v : G[r]) if(!tag[v]) cdq(v);
}

int main(){
	memset(ans, 0xa0, sizeof(ans));
	scanf("%d %d", &n, &k);
	for(int u = 1 ; u <= n ; u ++) scanf("%d", &a[u]);
	for(int i = 1, u = 0, v = 0 ; i < n ; i ++){
		scanf("%d %d", &u, &v);
		G[u].push_back(v), G[v].push_back(u);
	}
	cdq(1);
	for(int u = 1 ; u <= n ; u ++) printf("%d\n", ans[u]);
	return 0;
}