#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);
  }
  int64_t ans = 0;
  auto dfs = [&](auto &&self, int node, int pr, int len, int64_t sum) -> void {
    if (len == k) {
      ans = max(ans, sum);
    } else {
      for (auto &son : g[node]) {
        if (son ^ pr) {
          self(self, son, node, len + 1, sum + a[son]);
        }
      }
    }
  };
  for (int i = 0; i < n; i++) {
    dfs(dfs, i, -1, 1, a[i]);
  }
  cout << ans << "\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;
}