#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long long Mod = 1e9 + 7;
const long double Pi = acos(-1);
int n, k;
vector<int> v[209];
int a[209];
int dp[209][209];
void dfs(int node, int p) {
  dp[node][0] = a[node];
  for (auto u : v[node]) {
    if (u == p) continue;
    dfs(u, node);
    dp[node][0] += dp[u][k - 1];
  }
  for (int j = 1; j <= n; j++) {
    if (k - j - 1 < 0) break;
    for (auto u : v[node]) {
      if (u == p) continue;
      int crnt = dp[u][j - 1];
      for (auto x : v[node]) {
        if (x == p || x == u) continue;
        crnt += dp[x][max(j - 1, k - j - 1)];
      }
      dp[node][j] = max(dp[node][j], crnt);
    }
  }
  for (int i = n - 1; i >= 0; i--)
    dp[node][i] = max(dp[node][i], dp[node][i + 1]);
}
int main() {
  cin >> n >> k;
  k++;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  dfs(0, 0);
  int mx = 0;
  for (int i = 0; i <= n; i++) mx = max(mx, dp[0][i]);
  cout << mx << endl;
}
