#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std;
const int N = 40007, M = 3007;
int n, k, a[N], ns[N];
int f[N][M], A[M], B[M], T[M], g[N][M], siz[N];
vi e[N];
void dfs1(int x, int fa) {
	siz[x] = 1, f[x][1] = a[x];
	for(auto v : e[x]) if(v != fa) {
		dfs1(v, x);
		L(i, 0, k) g[v][i] = f[x][i];
		me(T, -0x3f);
		L(i, 0, min(k, siz[x])) L(j, 0, min(k - i, siz[v])) T[i + j] = max(T[i + j], f[x][i] + f[v][j]);
		L(i, 0, k) f[x][i] = T[i];
		siz[x] += siz[v];
	}
	f[x][0] = 0;
}
void dfs2(int x, int fa) {
	int sz = siz[x];
	g[x][k] = 0;
	L(i, 0, k) A[i] = g[x][i];
	// A = mutiply(A, f_x)
	// B = B * f_x + A_i * g_x
	for(auto v : e[x]) if(v != fa) {
		sz -= siz[v];
		me(T, -0x3f);
		L(i, 0, min(k, siz[v])) L(j, 0, min(k - i, sz)) T[i] = max(T[i], A[i + j] + g[v][j]);
		L(i, 0, k) g[v][i] = T[i];
		me(T, -0x3f);
		L(i, 0, min(k, sz)) L(j, 0, min(k - i, siz[v])) T[i] = max(T[i], A[i + j] + f[v][j]);
		L(i, 0, k) A[i] = T[i];
	}
	L(i, 1, k) ns[x] = max(ns[x], f[x][i] + g[x][i]);
	for(auto v : e[x]) if(v != fa) dfs2(v, x);
}
int main () {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0); 
	cin >> n >> k;
	L(i, 1, n) cin >> a[i];
	L(i, 1, n - 1) {
		int u, v;
		cin >> u >> v;
		e[u].emplace_back(v);
		e[v].emplace_back(u); 
	}
	me(f, -0x3f), me(g, -0x3f);
	dfs1(1, 0);
	dfs2(1, 0);
	L(i, 1, n) cout << ns[i] << ' ';
	return 0;
}