#include <bits/stdc++.h>

using namespace std;

void solve(int cs) {
  int n, k;
  cin >> n >> k;
  vector<int> a(n + 1);
  for (int i = 1; i <= n; i++) cin >> a[i];
  vector<vector<int>> g(n + 1);
  for (int i = 0; i < n - 1; i++) {
    int u, v; cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  const int64_t INF = -1e18;
  int64_t ans = INF;
  auto dfs = [&](auto &&self, int node, int pr) -> vector<int64_t> {
    vector<int64_t> dp(k + 1, INF);
    dp[1] = a[node];
    for (auto &son : g[node]) {
      if (son == pr) continue;
      auto cdp = self(self, son, node);
      for (int i = 1; i < k; i++) {
        if (dp[i] != INF && cdp[k - i] != INF) {
          ans = max(ans, dp[i] + cdp[k - i]);
        }
      }
      for (int i = 1; i < k; i++) {
        if (cdp[i] != INF) {
          dp[i + 1] = max(dp[i + 1], cdp[i] + dp[1]);
        }
      }
    }
    ans = max(ans, dp[k]);
    return dp;
  };
  dfs(dfs, 1, -1);
  cout << (ans == INF ? 0 : 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;
}