#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
vector<long long> arr;
vector<vector<int>> G;
int n, k;
vector<int> dfs(int x, int p) {
  vector<vector<int>> tmp;
  for (int i : G[x]) {
    if (i != p) {
      tmp.push_back(dfs(i, x));
    }
  }
  vector<int> ret(k + 1, 0);
  ret[0] = arr[x];
  for (int i = 0; i < tmp.size(); i++) ret[0] += tmp[i][k];
  for (int i = 1; i < k; i++) {
    if (i + i < k) {
      for (int j = 0; j < tmp.size(); j++)
        ret[i] = max(ret[i], tmp[j][i] - tmp[j][k - i]);
    }
    for (int j = 0; j < tmp.size(); j++) ret[i] += tmp[j][max(i, k - i)];
  }
  for (int i = k; i; i--) ret[i] = ret[i - 1];
  ret[0] = 0;
  for (int i = k - 1; i; i--) ret[i] = max(ret[i], ret[i + 1]);
  return ret;
}
int main() {
  cin.tie(0), ios::sync_with_stdio(0);
  cin >> n >> k;
  ++k;
  arr.resize(n);
  for (int i = 0; i < n; i++) cin >> arr[i];
  G.resize(n);
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    G[a - 1].push_back(b - 1);
    G[b - 1].push_back(a - 1);
  }
  cout << dfs(0, 0)[1] << "\n";
  return 0;
}
