#include <cstdio>
#include <vector>
using namespace std;
long long ans = 0;
int fa[100010], vis[100010], cnt[100010], now;
int find(int x) {
    if (vis[x] != now) return vis[x] = now, cnt[x] = 1, fa[x] = x;
    if (fa[x] == x) return x;
    return find(fa[x]);
}
void merge(int x, int y)  {
    x = find(x), y = find(y);
    if (x != y) {
        fa[x] = y;
        ans -= cnt[x] * (cnt[x] - 1) / 2;
        ans -= cnt[y] * (cnt[y] - 1) / 2;
        cnt[y] += cnt[x];
        ans += cnt[y] * (cnt[y] - 1) / 2;
    }
}
int n, q, u, v, w;
vector<pair<int, int> > E[100010];
long long res[100010];
int main() {
    scanf("%d%d", &n, &q);
    for (int i = 1; i < n; i++) {
        scanf("%d%d%d", &u, &v, &w);
        for (int j = 1; j * j <= w; j++) {
            if (w % j == 0) {
                E[j].push_back({u, v});
                if (j * j != w) {
                    E[w / j].push_back({u, v});
                }
            }
        }
    }
    for (int i = 1; i <= 100000; i++) {
        now++;
        ans = 0;
        for (int j = 0; j < E[i].size(); j++) {
            merge(E[i][j].first, E[i][j].second);
        }
        res[i] = ans;
    }
    for (int i = 1; i <= q; i++) {
        scanf("%d", &w);
        printf("%d\n", res[w]);
    }
    return 0;
}