#include <bits/stdc++.h>
using namespace std;
int mem[205][205];
int arr[205];
vector<int> adj[205];
int n, k;
int go(int node, int w, int pa = 0) {
  if (mem[node][w] != -1) return mem[node][w];
  mem[node][w] = 0;
  if (w == 0) {
    int cur = arr[node];
    for (int i : adj[node])
      if (i != pa) cur += go(i, k, node);
    mem[node][w] = max(mem[node][w], cur);
  }
  for (int x = max(w - 1, 0); x <= k; x++) {
    int nx = max(k - x - 1, 0);
    if (adj[node].size() > 2) nx = max(nx, k / 2);
    nx = max(nx, w - 1);
    int cur = 0, cur1 = 0;
    for (int i : adj[node])
      if (i != pa) cur1 += go(i, nx, node);
    for (int i : adj[node]) {
      if (i != pa) {
        int aa = cur1 - go(i, nx, node), bb = go(i, x, node);
        int z = cur1 - go(i, nx, node) + go(i, x, node);
        cur = max(cur, z);
      }
    }
    mem[node][w] = max(mem[node][w], cur);
  }
  return mem[node][w];
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  for (int i = 1; i < n; i++) {
    int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  memset(mem, -1, sizeof mem);
  cout << go(1, 0) << endl;
}
