#include <bits/stdc++.h>
using namespace std;
template <typename T>
T read1() {
  T t = 0;
  char k;
  bool vis = 0;
  do (k = getchar()) == '-' && (vis = 1);
  while ('0' > k || k > '9');
  while ('0' <= k && k <= '9')
    t = (t << 3) + (t << 1) + (k ^ '0'), k = getchar();
  return vis ? -t : t;
}
int s, k, dp[205][205], a[205];
vector<int> G[205];
void dfs(int n, int fa) {
  dp[n][0] = a[n];
  for (int i = 0; i < G[n].size(); ++i)
    if (G[n][i] ^ fa) {
      dfs(G[n][i], n);
      dp[n][0] += dp[G[n][i]][k];
      for (int j = 1; j <= s; ++j)
        for (int l = j; l <= s; ++l)
          dp[n][j] = max(dp[n][j], dp[n][l] + dp[G[n][i]][max(k - l, j - 1)]);
    }
  for (int i = s; i--;) dp[n][i] = max(dp[n][i], dp[n][i + 1]);
}
int main() {
  s = read1<int>(), k = read1<int>();
  for (int i = 1; i <= s; ++i) a[i] = read1<int>();
  for (int i = 1; i < s; ++i) {
    int u = read1<int>(), v = read1<int>();
    G[u].push_back(v);
    G[v].push_back(u);
  }
  dfs(1, 0);
  printf("%d", dp[1][0]);
  return 0;
}
