#include <bits/stdc++.h>

using namespace std;

struct edge {
	int u;
	int v;
} e[200086];

int n, k, cnt;
int head[200086];
int w[200086];
int dp[200086][21];

void AddEdge (int u, int v) {
	e[++cnt].u = v;
	e[cnt].v = head[u];
	head[u] = cnt;
}

void dfs (int cur, int fa) {
	for (int p = head[cur]; p; p = e[p].v) {
		if (e[p].u == fa) continue;
		dfs(e[p].u, cur);
		for (int i = 1; i <= k; i++)
			dp[cur][i] += dp[e[p].u][i - 1];
	}
}

void dfs2 (int cur, int fa) {
	for (int p = head[cur]; p; p = e[p].v) {
		if (e[p].u == fa) continue;
		dp[e[p].u][1] += dp[cur][0];
		for (int i = k; i > 1; i--)
			dp[e[p].u][i] -= dp[e[p].u][i - 2];
		for (int i = 1; i <= k; i++)
			dp[e[p].u][i] += dp[cur][i - 1];
		dfs(e[p].u, cur);
	}
}

int main () {
	scanf("%d%d", &n, &k);
	for (int i = 1, u, v; i < n; i++) {
		scanf("%d%d", &u, &v);
		AddEdge(u, v);
		AddEdge(v, u);
	}
	for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
	for (int i = 1; i <= n; i++) dp[i][0] = w[i];
	dfs(1, -1);
	dfs2(1, -1);
	for (int i = 1; i <= n; i++) {
		int ans = 0;
		for (int j = 0; j <= k; j++)
			ans += dp[i][j];
		printf("%d\n", ans);
	}
	return 0;
}

样例输出：

15
41
15
4
9
6