#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int pre[maxn];
long long sum[maxn], ans[maxn];
int cnt = 0, n, m;
struct node1 {
  int u, v, w;
} e[maxn];
struct node2 {
  int id, val;
} ques[maxn];
int Find(int x) {
  int a = x;
  while (x != pre[x]) x = pre[x];
  while (a != pre[a]) {
    int temp = a;
    a = pre[a];
    pre[temp] = x;
  }
  return x;
}
bool cmp(node1 &n1, node1 &n2) { return n1.w < n2.w; }
bool cmp2(node2 &n1, node2 &n2) { return n1.val < n2.val; }
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i <= n; i++) pre[i] = i, sum[i] = 1;
  for (cnt = 0; cnt < n - 1; cnt++) {
    scanf("%d%d%d", &e[cnt].u, &e[cnt].v, &e[cnt].w);
  }
  sort(e, e + n - 1, cmp);
  for (int i = 0; i < m; i++) {
    scanf("%d", &ques[i].val);
    ques[i].id = i;
  }
  sort(ques, ques + m, cmp2);
  long long summ = 0;
  int t = 0;
  for (int i = 0; i < m; i++) {
    while (t < n - 1 && e[t].w <= ques[i].val) {
      int fu = Find(e[t].u);
      int fv = Find(e[t].v);
      if (fu == fv) {
        continue;
      } else {
        summ -= sum[fu] * (sum[fu] - 1) / 2;
        summ -= sum[fv] * (sum[fv] - 1) / 2;
        if (fv < fu) {
          pre[fu] = fv;
          sum[fv] += sum[fu];
          summ += (sum[fv] * (sum[fv] - 1) / 2);
        } else {
          pre[fv] = fu;
          sum[fu] += sum[fv];
          summ += (sum[fu] * (sum[fu] - 1) / 2);
        }
      }
      t++;
    }
    ans[ques[i].id] = summ;
  }
  for (int i = 0; i < m; i++) {
    printf("%I64d%c", ans[i], (i == m - 1) ? '\n' : ' ');
  }
  return 0;
}
