#include <bits/stdc++.h>

using namespace std;

void solve(int cs) {
  int n, k;
  cin >> n >> k;
  vector<int64_t> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<vector<int>> g(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v; cin >> u >> v;
    --u, --v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  vector<vector<int64_t>> dp(n, vector<int64_t>(k + 1, LLONG_MIN));
  auto dfs = [&](auto &&self, int node, int pr, int len) -> int64_t {
    if (len == 1) return dp[node][len] = a[node];
    if (dp[node][len] != LLONG_MIN) return dp[node][len];
    int64_t ret = 0;
    for (auto &son : g[node]) {
      if (son ^ pr) {
        ret = max(ret, self(self, son, node, len - 1));
      }
    }
    return dp[node][len] = ret + a[node];
  };
  cout << dfs(dfs, 0, -1, k) << "\n";
}

int32_t main() {
  ios::sync_with_stdio(!cin.tie(0));
  int t = 1;
  // cin >> t;
  for (int i = 1; i <= t; ++i) {
    solve(i);
  }
  return 0;
}