#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
struct node {
  int u, v, w;
  friend bool operator<(const node &x, const node &y) { return x.w < y.w; }
};
struct query {
  int q, id;
  long long ans;
};
vector<node> edges;
vector<query> querys;
int pa[maxn], sz[maxn];
int find(int u) {
  if (pa[u] == u) return u;
  return pa[u] = find(pa[u]);
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    pa[i] = i;
    sz[i] = 1;
  }
  for (int i = 1; i < n; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    edges.push_back({u, v, w});
  }
  sort(edges.begin(), edges.end());
  for (int i = 0; i < m; i++) {
    int q;
    scanf("%d", &q);
    querys.push_back({q, i, 0});
  }
  sort(querys.begin(), querys.end(),
       [](const query &x, const query &y) { return x.q < y.q; });
  long long res = 0;
  int id = 0;
  for (int i = 0; i < m; i++) {
    while (id < n - 1 && edges[id].w <= querys[i].q) {
      int fu = find(edges[id].u);
      int fv = find(edges[id].v);
      if (fu != fv) {
        pa[fu] = fv;
        res = (res - 1LL * sz[fu] * (sz[fu] - 1) / 2 -
               1LL * sz[fv] * (sz[fv] - 1) / 2 +
               1LL * (sz[fu] + sz[fv]) * (sz[fu] + sz[fv] - 1) / 2);
        sz[fv] += sz[fu];
      }
      id++;
    }
    querys[i].ans = res;
  }
  sort(querys.begin(), querys.end(),
       [](const query &x, const query &y) { return x.id < y.id; });
  for (int i = 0; i < m; i++) printf("%lld ", querys[i].ans);
  return 0;
}
