#include <bits/stdc++.h>
using namespace std;
long long a[405];
long long n;
long long kk;
struct edge {
  long long des;
  long long next;
} e[405 << 1];
long long cnt;
long long head[405];
long long dp[405][405];
long long tmp[405];
long long length[405];
void ins(long long u, long long v) {
  ++cnt;
  e[cnt].des = v;
  e[cnt].next = head[u];
  head[u] = cnt;
}
void dfs(long long u, long long f) {
  dp[u][0] = a[u];
  for (long long i = head[u]; i; i = e[i].next) {
    long long v = e[i].des;
    if (v == f) continue;
    dfs(v, u);
    long long newlength = max(length[u], length[v] + 1);
    for (long long j = 0; j <= newlength; ++j) tmp[j] = -1;
    for (long long j = 0; j <= length[u]; ++j) {
      for (long long k = kk + 1 - j - 1; k <= length[v]; ++k) {
        tmp[min(j, k + 1)] = max(tmp[min(j, k + 1)], dp[u][j] + dp[v][k]);
      }
    }
    for (long long j = 0; j <= length[v]; ++j)
      tmp[j + 1] = max(tmp[j + 1], dp[v][j]);
    length[u] = newlength;
    for (long long j = 0; j <= newlength; ++j) dp[u][j] = max(tmp[j], dp[u][j]);
    for (long long j = newlength - 1; j >= 0; --j)
      dp[u][j] = max(dp[u][j], dp[u][j + 1]);
  }
}
int main() {
  scanf("%lld %lld", &n, &kk);
  for (long long i = 1; i <= n; ++i) scanf("%lld", a + i);
  for (long long i = 1; i < n; ++i) {
    long long u;
    long long v;
    scanf("%lld %lld", &u, &v);
    ins(u, v);
    ins(v, u);
  }
  dfs(1, 0);
  printf("%lld\n", dp[1][0]);
  return 0;
}
