#include <bits/stdc++.h>

using namespace std;

#define pb emplace_back
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int INF = 0x3f3f3f3f;

const int N = 4e4 + 10;
const int K = 3e3 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

void cmax(int &a, int b) { a < b ? a = b : 1; }

int n, k, a[N], sz[N], f[N][K], g[N][K], h[K], o[K], cur[N];
vector <int> e[N];

void dfs0(int u, int fa) {
  sz[u] = 1, f[u][1] = a[u];
  for (int v : e[u]) if (v != fa) {
    dfs0(v, u), cur[v] = min(sz[u], k);
    rep(i, 0, min(sz[u], k)) {
      g[v][i] = o[i] = f[u][i], f[u][i] = -INF;
    }
    rep(i, 0, min(sz[u], k)) {
      rep(j, 0, min(sz[v], k - i)) {
        cmax(f[u][i + j], o[i] + f[v][j]);
      }
    }
    sz[u] += sz[v];
  }
  f[u][0] = 0;
}

void dfs1(int u, int fa) {
  g[u][0] = 0;
  reverse(e[u].begin(), e[u].end());
  rep(i, 1, k) h[i] = -INF;
  int tot = min(k, n - sz[u]);
  rep(i, 0, tot) h[i] = g[u][i];
  for (int v : e[u]) if (v != fa) {
    // cout << "u, v = " << u << ' ' << v << endl;
    // pa(h, 0, k);
    rep(i, 0, cur[v]) o[i] = g[v][i], g[v][i] = -INF;
    rep(i, 0, min(tot, k)) {
      rep(j, 0, min(cur[v], k - i)) {
        // cout << "u, v, i, j = " << u << ' ' << v << ' ' << i << ' ' << j << endl;
        cmax(g[v][i + j], h[i] + o[j]);
      }
    }
    cur[v] += tot;
    rep(i, 0, min(tot, k)) o[i] = h[i], h[i] = -INF;
    rep(i, 0, min(tot, k)) {
      rep(j, 0, min(sz[v], k - i)) {
        cmax(h[i + j], o[i] + f[v][j]);
      }
    }
    tot += sz[v];
  }
  reverse(e[u].begin(), e[u].end());
  for (int v : e[u]) if (v != fa) dfs1(v, u);
}

int main() {
  n = read(), k = read();
  rep(i, 1, n) a[i] = read();
  rep(i, 1, n - 1) {
    int u = read(), v = read();
    e[u].pb(v), e[v].pb(u);
  }
  rep(u, 1, n) rep(i, 0, k) {
    f[u][i] = g[u][i] = -INF;
  }
  dfs0(1, 0);
  dfs1(1, 0);
  rep(u, 1, n) {
    // pv(u);
    // pa(f[u], 0, k);
    // pa(g[u], 0, k);
    int ans = -INF;
    rep(i, 1, k) cmax(ans, f[u][i] + g[u][k - i]);
    printf("%d%c", ans, " \n"[u == n]);
  }
  return 0;
}