#include <bits/stdc++.h>
using namespace std;
struct edge {
  int u, v, w;
  edge() {}
  edge(int i, int j, int ww) { u = i, j = v, w = ww; }
};
long long int sz[200005];
int par[200005];
vector<long long int> res(200005);
long long int ans = 0;
int Root(int a) {
  while (a != par[a]) a = par[a];
  return a;
}
void Union(int a, int b) {
  int ra = Root(a);
  int rb = Root(b);
  if (ra == rb) return;
  ans += sz[ra] * sz[rb];
  if (sz[ra] > sz[rb]) {
    par[rb] = ra;
    sz[ra] += sz[rb];
  } else {
    par[ra] = rb;
    sz[rb] += sz[ra];
  }
}
bool comp(edge o1, edge o2) { return o1.w < o2.w; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  for (int i = 0; i < 200005; i += 1) par[i] = i, sz[i] = 1;
  int n, m;
  cin >> n >> m;
  vector<edge> a(n - 1);
  for (int i = 0; i < n - 1; i += 1) cin >> a[i].u >> a[i].v >> a[i].w;
  sort(a.begin(), a.end(), comp);
  vector<pair<int, int> > q(m);
  for (int i = 0; i < m; i += 1) {
    cin >> q[i].first;
    q[i].second = i;
  }
  sort(q.begin(), q.end());
  int ptr = 0;
  for (int i = 0; i < m; i += 1) {
    int wt = q[i].first;
    int j = q[i].second;
    while (ptr < n - 1 && a[ptr].w <= wt) {
      Union(a[ptr].u, a[ptr].v);
      ptr++;
    }
    res[j] = ans;
  }
  for (int i = 0; i < m; i += 1) cout << res[i] << ' ';
  cout << '\n';
}
