#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
const long long mod = 1000000007;
const long long inf = 1000000009;
const long long INF = 1000000000000000009;
const long long big = 1000000000000000;
const long double eps = 0.000000000000000000001;
using namespace std;
long long n, k;
long long T[205], DP[205][205];
vector<long long> P[205];
void dfs(long long n, long long p) {
  DP[n][0] = T[n];
  for (auto v : P[n]) {
    if (v != p) dfs(v, n);
    DP[n][0] += DP[v][k - 1];
  }
  for (long long i = 1; i < k; i++) {
    long long maks = 0;
    long long suma = 0;
    for (auto v : P[n])
      if (v != p) {
        suma += DP[v][max(i - 1, k - i - 1)];
        maks = max(maks, DP[v][i - 1] - DP[v][max(i - 1, k - i - 1)]);
      }
    suma += maks;
    DP[n][i] = suma;
  }
  for (long long i = k - 2; i >= 0; i--) DP[n][i] = max(DP[n][i], DP[n][i + 1]);
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  k++;
  for (long long i = 1; i <= n; i++) cin >> T[i];
  for (long long i = 1; i < n; i++) {
    long long a, b;
    cin >> a >> b;
    P[a].push_back(b);
    P[b].push_back(a);
  }
  dfs(1, 0);
  cout << DP[1][0];
  return 0;
}
