#include <bits/stdc++.h>
using namespace std;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
bool IN(long long x, long long l, long long r) { return l <= x and x <= r; }
void gg1() {
  write2(-1);
  exit(0);
}
void gg2() {
  puts("No");
  exit(0);
}
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T>
void add(T &x, const int &y) {
  x = (x + y >= MOD ? x + y - MOD : x + y);
}
long long qpower(long long x, long long e, int mod = MOD) {
  long long ans = 1;
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int N = 2e2 + 10;
vector<int> to[N];
int siz[N], a[N];
int dp[N][N], dp2[N];
int K;
void solve(int x, int fa) {
  siz[x] = 1;
  int sum = a[x];
  for (auto y : to[x])
    if (y != fa) {
      solve(y, x);
      int mx = 0;
      for (int i = (K), I = (siz[y]); i <= I; i++) chmax(mx, dp[y][i]);
      for (int i = (0), I = (N - 1); i <= I; i++) dp2[i] = 0;
      for (int i = (1), I = (siz[y]); i <= I; i++) dp2[i] = dp[y][i - 1];
      for (int i = (0), I = (siz[x]); i <= I; i++)
        for (int j = (0), I = (siz[y]); j <= I; j++)
          if (i + j + 1 > K) chmax(dp2[min(i, j + 1)], dp[x][i] + dp[y][j]);
      sum += mx;
      siz[x] += siz[y];
      for (int i = (1), I = (siz[x]); i <= I; i++) chmax(dp[x][i], dp2[i]);
    }
  dp[x][0] = sum;
}
void main() {
  int n = qread();
  K = qread();
  for (int i = (1), I = (n); i <= I; i++) a[i] = qread();
  for (int i = (2), I = (n); i <= I; i++) {
    int x = qread(), y = qread();
    to[x].push_back(y), to[y].push_back(x);
  }
  solve(1, 0);
  int ans = 0;
  for (int i = (0), I = (n); i <= I; i++) chmax(ans, dp[1][i]);
  write(ans);
}
};  // namespace mine
signed main() {
  srand(time(0));
  mine::main();
}
