#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
using LL = long long;
int n, k, a[40010], siz[40010], rnk[40010], cnt;
basic_string<int> g[40010];
bool cut[40010];
int findcen(int rt, int T) {/*{{{*/
  pair<int, int> cen{(int)1e9, 0};
  auto dfs = [&](auto& dfs, int u, int fa) -> void {
    int smx = siz[u] = 1;
    for (int v : g[u]) if (!cut[v] && v != fa) dfs(dfs, v, u), siz[u] += siz[v], smx = max(smx, siz[v]);
    cen = min(cen, {max(smx, T - siz[u]), u});
  };
  return dfs(dfs, rt, 0), cen.second;
}/*}}}*/
int fans[40010];
void dfs(int kd, int u, int fa) {
  rnk[++cnt] = u;
  siz[u] = 1;
  if (kd) reverse(g[u].begin(), g[u].end());
  for (int v : g[u]) if (v != fa && !cut[v]) dfs(kd, v, u), siz[u] += siz[v];
  if (kd) reverse(g[u].begin(), g[u].end());
}
vector<int> f[40010], tmp[40010][2];
void calc(int u, int fa, int sum, int c) {
  if (++c > k) return ;
  sum += a[u];
  const auto& [lhs, rhs] = tmp[u];
#ifdef LOCAL
  debug("calc(%d, sum=%d, c=%d)\n", u, sum, c);
  debug("lhs: "); for (int x : lhs) debug("%d, ", x); debug("\n");
  debug("rhs: "); for (int x : rhs) debug("%d, ", x); debug("\n");
#endif
  for (int i = 0; i <= k - c && i < (int)lhs.size(); i++) {
    if (k - c - i < (int)rhs.size()) fans[u] = max(fans[u], sum + lhs[i] + rhs[k - c - i]);
  }
  for (int v : g[u]) if (v != fa && !cut[v]) calc(v, u, sum, c);
}
void work(int rt) {
  for (int kd : {0, 1}) {
    dfs(kd, rt, cnt = 0);
    if (cnt < k) return ;
    f[cnt + 1] = {0};
    for (int j = cnt; j >= 1; j--) {
      f[j] = f[j + siz[rnk[j]]];
      if (f[j].size() < f[j + 1].size() + 1) f[j].resize(f[j + 1].size() + 1, numeric_limits<int>::min());
      for (size_t k = 0; k < f[j + 1].size(); k++) f[j][k + 1] = max(f[j][k + 1], f[j + 1][k] + a[rnk[j]]);
    }
    for (int j = cnt; j >= 1; j--) tmp[rnk[j]][kd] = move(f[j + 1]);
  }
  debug("rt = %d\n", rt);
  calc(rt, 0, 0, 0);
}
void solve(int rt) {
  cut[rt] = true;
  work(rt);
  for (int v : g[rt]) if (!cut[v]) solve(findcen(v, siz[v]));
}
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);  
#endif
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1, u, v; i < n; i++) cin >> u >> v, g[u] += v, g[v] += u;
  solve(findcen(1, n));
  for (int i = 1; i <= n; i++) cout << fans[i] << " \n"[i == n];
  return 0;
}