#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int64_t N = 228;
vector<int64_t> g[N];
int64_t c[N], dp[N][N];
int64_t n, k;
void dfs(int64_t v, int64_t p) {
  if (g[v].size() == 1 && g[v][0] == p) {
    dp[v][0] = c[v];
    return;
  }
  for (int64_t x : g[v])
    if (x != p) dfs(x, v);
  dp[v][0] = c[v];
  for (int64_t x : g[v]) {
    if (x != p) {
      int64_t mx = 0;
      for (int64_t kk = k - 1; kk <= 200; kk++) mx = max(mx, dp[x][kk]);
      dp[v][0] += mx;
    }
  }
  for (int64_t x : g[v]) {
    if (x == p) continue;
    for (int64_t kk = 0; kk <= k; kk++) {
      int64_t sum = dp[x][kk];
      int64_t f = k - kk - 2;
      if (2 * f + 2 < k) f = kk;
      for (int64_t j : g[v]) {
        if (j == x || j == p) continue;
        int64_t mx = 0;
        for (int64_t i = f; i <= 200; i++) mx = max(mx, dp[j][i]);
        sum += mx;
      }
      dp[v][kk + 1] = max(dp[v][kk + 1], sum);
    }
  }
}
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  k++;
  for (int64_t i = 0; i < n; i++) cin >> c[i];
  for (int64_t i = 0; i < n - 1; i++) {
    int64_t u, v;
    cin >> u >> v;
    u--;
    v--;
    g[v].push_back(u);
    g[u].push_back(v);
  }
  dfs(0, 0);
  int64_t res = 0;
  for (int64_t i = 0; i < N; i++)
    for (int64_t j = 0; j < N; j++) res = max(res, dp[i][j]);
  cout << res;
}
