#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 69;
const long long mod = 1e9 + 7;
const long long lim = (1LL << 31) - 1;
long long par[maxn], S[maxn], kq[maxn];
array<int, 2> a[maxn];
int Find_par(int u) {
  if (par[u] != u) par[u] = Find_par(par[u]);
  return par[u];
}
void Link(int u, int v) {
  if (S[u] < S[v]) swap(u, v);
  S[u] += S[v];
  par[v] = u;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  vector<array<int, 3>> edges;
  for (int i = 1; i < n; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    edges.push_back({w, u, v});
  }
  for (int i = 1; i <= n; i++) {
    S[i] = 1;
    par[i] = i;
  }
  for (int i = 1; i <= m; i++) {
    cin >> a[i][0];
    a[i][1] = i;
  }
  sort(a + 1, a + m + 1);
  sort(edges.begin(), edges.end());
  int dem = 1;
  long long ans = 0;
  for (auto j : edges) {
    while (j[0] > a[dem][0] && dem <= m) {
      kq[a[dem][1]] = ans;
      dem++;
    }
    int paru = Find_par(j[1]);
    int parv = Find_par(j[2]);
    if (paru == parv) continue;
    ans = ans - S[paru] * (S[paru] - 1) / 2 - S[parv] * (S[parv] - 1) / 2 +
          (S[parv] + S[paru]) * (S[parv] + S[paru] - 1) / 2;
    Link(paru, parv);
  }
  while (dem <= m) {
    kq[a[dem][1]] = ans;
    dem++;
  }
  for (int i = 1; i <= m; i++) {
    cout << kq[i] << " ";
  }
}
