#include <bits/stdc++.h>
using namespace std;
struct edge {
  long long f, t, w;
  bool operator<(edge x) const { return w < x.w; }
} e[200005];
struct query {
  long long w, i, ans;
  bool operator<(query x) const { return w < x.w; }
} qq[200005];
long long p[200005], num[200005];
long long find(long long x) { return p[x] ? p[x] = find(p[x]) : x; }
bool cmp(query x, query y) { return x.i < y.i; }
int main() {
  long long n, q, i, j, k, t;
  cin >> n >> q;
  num[n] = 1;
  for (i = 1; i < n; i++) {
    cin >> e[i].f >> e[i].t >> e[i].w;
    num[i] = 1;
  }
  for (i = 1; i <= q; i++) {
    cin >> qq[i].w;
    qq[i].i = i;
  }
  sort(e + 1, e + n);
  sort(qq + 1, qq + i);
  for (i = j = 1; j <= q; j++) {
    qq[j].ans = qq[j - 1].ans;
    while (i < n && e[i].w <= qq[j].w) {
      k = find(e[i].f);
      t = find(e[i].t);
      qq[j].ans -= (num[t] * (num[t] - 1) >> 1) + (num[k] * (num[k] - 1) >> 1);
      num[k] += num[t];
      p[t] = k;
      qq[j].ans += num[k] * (num[k] - 1) >> 1;
      i++;
    }
  }
  sort(qq + 1, qq + q + 1, cmp);
  for (i = 1; i <= q; i++) cout << qq[i].ans << (i == q ? '\n' : ' ');
  return 0;
}
