#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
int par[N];
int sz[N];
long long all_path;
int P(int u) {
  if (par[u] == u) return u;
  return par[u] = P(par[u]);
}
void Merge(int u, int v) {
  u = P(u);
  v = P(v);
  par[v] = u;
  all_path += 1ll * sz[u] * sz[v];
  sz[u] += sz[v];
}
long long res[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) par[i] = i, sz[i] = 1;
  vector<tuple<int, int, int>> edges;
  for (int i = 1; i < n; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    edges.push_back(make_tuple(w, u, v));
  }
  sort(edges.begin(), edges.end());
  reverse(edges.begin(), edges.end());
  vector<pair<int, int>> offline_queries;
  for (int i = 1; i <= q; i++) {
    int w;
    cin >> w;
    offline_queries.push_back({w, i});
  }
  sort(offline_queries.begin(), offline_queries.end());
  for (int i = 0; i < q; i++) {
    int w = offline_queries[i].first, idx = offline_queries[i].second;
    while (edges.size() > 0 && get<0>(edges.back()) <= w) {
      int u = get<1>(edges.back()), v = get<2>(edges.back());
      edges.pop_back();
      Merge(u, v);
    }
    res[idx] = all_path;
  }
  for (int i = 1; i <= q; i++) {
    cout << res[i] << " ";
  }
}
