#include <bits/stdc++.h>
using namespace std;
bool check(long long n, long long pos) { return n & (1LL << pos); }
long long Set(long long n, long long pos) { return n = n | (1LL << pos); }
vector<long long> graph[203];
long long arr[203];
long long dp[203][203];
long long n, k;
void dfs(long long node, long long par = 0) {
  for (auto it : graph[node]) {
    if (it == par) continue;
    dfs(it, node);
  }
  for (long long d = 0; d <= n; d++) {
    if (d == 0) {
      dp[node][d] = arr[node];
      for (auto it : graph[node]) {
        if (it == par) continue;
        dp[node][d] += dp[it][k - 1];
      }
    } else {
      for (auto it : graph[node]) {
        if (it == par) continue;
        long long x = dp[it][d - 1];
        for (auto jt : graph[node]) {
          if (jt == par) continue;
          if (it == jt) continue;
          x += dp[jt][max(d - 1, k - d - 1)];
        }
        dp[node][d] = max(dp[node][d], x);
      }
    }
  }
  for (long long i = n - 1; i >= 0; i--) {
    dp[node][i] = max(dp[node][i], dp[node][i + 1]);
  }
}
int main() {
  long long i, j, l, m, o, r, q;
  long long testcase;
  long long input, flag, tag, ans;
  while (cin >> n >> k) {
    for (i = 1; i <= n; i++) graph[i].clear();
    k++;
    memset(dp, 0, sizeof dp);
    for (i = 1; i <= n; i++) scanf("%lld", &arr[i]);
    for (i = 1; i < n; i++) {
      long long u, v;
      scanf("%lld", &u);
      scanf("%lld", &v);
      graph[u].push_back(v);
      graph[v].push_back(u);
    }
    dfs(1);
    printf("%lld\n", dp[1][0]);
  }
}
