#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void amin(T &a, U b) {
  a = (a > b ? b : a);
}
template <typename T, typename U>
inline void amax(T &a, U b) {
  a = (a > b ? a : b);
}
const int N = 2e5 + 5;
int f[N], sz[N];
int64_t ans = 0;
void init(int n) {
  for (int i = 0; i < n; ++i) f[i] = i, sz[i] = 1;
}
int root(int x) {
  while (x != f[x]) {
    f[x] = f[f[x]];
    x = f[x];
  }
  return x;
}
int64_t calc(int64_t x) {
  int64_t res = 0;
  amax(res, x * (x - 1) / 2);
  return res;
}
bool merge(int x, int y) {
  int a = root(x), b = root(y);
  if (a == b) return true;
  if (sz[a] > sz[b]) swap(a, b);
  ans -= calc(sz[a]);
  ans -= calc(sz[b]);
  f[a] = b;
  sz[b] += sz[a];
  ans += calc(sz[b]);
  return false;
}
bool isConnected(int x, int y) {
  if (root(x) == root(y))
    return true;
  else
    return false;
}
void solve() {
  int n, q;
  cin >> n >> q;
  init(n);
  vector<array<int, 3>> edges;
  for (int i = 0; i < n - 1; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    --u, --v;
    edges.push_back({w, u, v});
  }
  sort(edges.begin(), edges.end());
  do {
  } while (0);
  vector<pair<int, int>> query(q);
  for (int i = 0; i < q; ++i) {
    cin >> query[i].first;
    query[i].second = i;
  }
  sort(query.begin(), query.end());
  int L = 0;
  vector<int64_t> pairs(q, 0);
  for (auto &[W, i] : query) {
    do {
    } while (0);
    while (L < n - 1 && edges[L][0] <= W) {
      merge(edges[L][1], edges[L][2]);
      ++L;
    }
    do {
    } while (0);
    pairs[i] = ans;
  }
  for (auto i : pairs) cout << i << " ";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int tests = 1;
  while (tests--) {
    solve();
  }
}
