#include <bits/stdc++.h>
using namespace std;
const int maxn = 200 + 10;
vector<int> G[maxn];
int dp[maxn][maxn];
int weight[maxn];
int n, k;
void dfs(int now, int fa) {
  dp[now][0] = weight[now];
  for (auto it : G[now]) {
    if (it == fa) continue;
    dfs(it, now);
  }
  for (int dep = 0; dep <= n; ++dep) {
    if (dep == 0) {
      for (auto it : G[now]) {
        if (it == fa) continue;
        dp[now][0] += dp[it][max(0, k - 1)];
      }
    } else {
      for (auto son : G[now]) {
        if (son == fa) continue;
        int cnt = dp[son][dep - 1];
        for (auto other : G[now]) {
          if (other == fa || other == son) continue;
          cnt += dp[other][max(dep - 1, k - dep - 1)];
        }
        dp[now][dep] = max(dp[now][dep], cnt);
      }
    }
  }
  for (int i = n - 1; i >= 0; --i) dp[now][i] = max(dp[now][i], dp[now][i + 1]);
}
int main() {
  cin >> n >> k;
  k++;
  for (int i = 1; i <= n; ++i) cin >> weight[i];
  for (int i = 1; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  dfs(1, 0);
  printf("%d\n", dp[1][0]);
  return 0;
}
