#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <iostream>
#include <algorithm>
#define pii pair <int , int>
#define pll pair <LL , LL>
#define mp make_pair
#define fs first
#define sc second
using namespace std;
typedef long long LL;

//const int Mxdt=100000;
//static char buf[Mxdt],*p1=buf,*p2=buf;
//#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxdt,stdin),p1==p2)?EOF:*p1++;


template <typename T>
void read(T &x) {
	T f=1;x=0;char s=getchar();
	while(s<'0'||s>'9') {if(s=='-') f=-1;s=getchar();}
	while(s>='0'&&s<='9') {x=(x<<3)+(x<<1)+(s^'0');s=getchar();}
	x *= f;
}

template <typename T>
void write(T x , char s='\n') {
	if(!x) {putchar('0');putchar(s);return;}
	if(x<0) {putchar('-');x=-x;}
	T t = 0 , tmp[25] = {};
	while(x) tmp[t ++] = x % 10 , x /= 10;
	while(t -- > 0) putchar(tmp[t] + '0');
	putchar(s);
}

const int MAXN = 4e4 + 5;
const int MAXK = 3e3 + 5;

int f[MAXN][MAXK] , g[MAXN][MAXK] , a[MAXN] , siz[MAXN] , n , k , tmp[MAXK];
vector <int> G[MAXN];
int Ans[MAXN];

void dfs1(int x , int fa) {
	siz[x] = 1;
	f[x][1] = a[x];
	for (auto v:G[x]) {
		if(v == fa) continue;
		dfs1(v , x);
		for (int i = 1; i <= min(k , siz[x] + siz[v]); ++i) tmp[i] = 0;
		for (int i = 1; i <= min(k , siz[x]); ++i) g[v][i] = f[x][i];
		for (int i = 1; i <= min(k , siz[x]); ++i) for (int j = 0; j <= min(k , siz[v]); ++j) tmp[i + j] = max(tmp[i + j] , f[x][i] + f[v][j]);
		siz[x] += siz[v];
		for (int i = 1; i <= min(k , siz[x]); ++i) f[x][i] = tmp[i];  
	}
}

void dfs2(int x , int fa) {
	for (int i = 1; i <= min(siz[x] , k); ++i) Ans[x] = max(g[x][i] + f[x][i] , Ans[x]);
	reverse(G[x].begin() , G[x].end());
	int s = siz[x];
	for (auto v:G[x]) {
		if(v == fa) continue;
		s -= siz[v];
		for (int i = 1; i <= min(k , siz[v]); ++i) tmp[i] = 0;
		for (int i = 1; i <= min(k , siz[v]); ++i) for (int j = 1; j <= min(k , s) && i + j <= k; ++j) tmp[i] = max(tmp[i] , g[v][j] + g[x][i + j]);
		for (int i = 1; i <= min(k , siz[v]); ++i) g[v][i] = tmp[i];
		dfs2(v , x);
		
		for (int j = 1; j <= min(k , s); ++j) tmp[j] = 0;
		for (int j = 1; j <= min(k , s); ++j) for (int i = 1; i <= min(k , siz[v]) && i + j <= k; ++i) tmp[j] = max(tmp[j] , f[v][i] + g[x][j + i]);
		for (int j = 1; j <= min(k , s); ++j) g[x][j] = tmp[j];
	}
}

int main() {
	read(n),read(k);
	for (int i = 1; i <= n; ++i) read(a[i]);
	for (int i = 1; i < n; ++i) {
		int u , v;
		read(u),read(v);
		G[u].push_back(v) , G[v].push_back(u);
	}
	dfs1(1 , 0);
	dfs2(1 , 0);
	for (int i = 1; i <= n; ++i) write(Ans[i] , ' ');
	puts("");
	return 0;
}