#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#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 FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 4e4 + 9;
constexpr int M = 3e3 + 9;
int n, k, a[N];

vi G[N];

bool vis[N];

int sz[N], id1[N], id2[N], sq1[N], sq2[N], c1, c2, fa[N];

void dfs (int u, int f) {
  sz[u] = 1;
  fa[u] = f;
  sq1[id1[u] = ++c1] = u;
  for (int v : G[u]) {
    if (vis[v] || v == f) {
      continue;
    }
    dfs(v, u);
    sz[u] += sz[v];
  }
  sq2[id2[u] = ++c2] = u;
}

int calc_mx (int x, int all) {
  int mxs = all - sz[x];
  for (int y : G[x]) {
    if (vis[y] || sz[y] > sz[x]) {
      continue;
    }
    mxs = max(mxs, sz[y]);
  }
  return mxs;
}

int get_rt (int L, int R) {
  int all = sz[sq1[L]];
  return *min_element(sq1 + L, sq1 + R, [&] (int x, int y) {
    return calc_mx(x, all) < calc_mx(y, all);
  });
}

int f[N][M], g[N][M], ns[N];

void dfz (int u) {
  dfs(u, 0);
  vis[u] = true;
  int S = sz[u];
  f[S + 1][0] = g[0][0] = 0;
  L (i, 1, k) {
    f[S + 1][i] = g[0][i] = INT_MIN / 2;
  }
  R (i, S, 1) {
    int x = sq1[i];
    L (j, 0, k) {
      f[i][j] = f[i + sz[x]][j];
    }
    L (j, 1, k) {
      f[i][j] = max(f[i][j], f[i + 1][j - 1] + a[x]);
    }
  }
  L (i, 1, S) {
    int x = sq2[i];
    L (j, 0, k) {
      g[i][j] = g[i - sz[x]][j];
    }
    L (j, 1, k) {
      g[i][j] = max(g[i][j], g[i - 1][j - 1] + a[x]);
    }
  }
  L (i, 1, S) {
    int x = sq1[i];
    int w = 0, h = 0;
    for (int y = x; y; y = fa[y]) {
      w += a[y];
      ++h;
    }
    L (j, 0, k - h) {
      ns[x] = max(ns[x], f[i + 1][j] + g[id2[x] - sz[x]][k - h - j] + w);
    }
  }
  vi nx;
  for (int v : G[u]) {
    if (vis[v] || sz[v] < k) {
      continue;
    }
    nx.eb(get_rt(id1[u], id1[u] + sz[u]));
  }
  c1 = c2 = 0;
  for (int rt : nx) {
    dfz(rt);
  }
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> k;
  L (i, 1, n) {
    cin >> a[i];
  }
  L (i, 1, n - 1) {
    int u, v;
    cin >> u >> v;
    G[u].eb(v);
    G[v].eb(u);
  }
  dfs(1, 0), c1 = c2 = 0;
  dfz(get_rt(1, n + 1));
  L (i, 1, n) {
    cout << ns[i] << " \n"[i == n];
  }
}
// I love WHQ!