#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000 + 5;
typedef long long i64;

int N, W, Q;
struct Edge {
    int x, y, w;
} e[MAX_N];
vector<int> dv[MAX_N], ei[MAX_N];
int fath[MAX_N], siz[MAX_N];
i64 now, ans[MAX_N];

int get_fath(int i) {
    return fath[i] == i ? i : fath[i] = get_fath(fath[i]);
}

int main() {
    scanf("%d%d", &N, &Q);
    for (int i = 1; i < N; i ++) {
        scanf("%d%d%d", &e[i].x, &e[i].y, &e[i].w);
        W = max(W, e[i].w);
    }
    for (int i = 1; i <= W; i ++) {
        ans[i] = -1;
        for (int j = i; j <= W; j += i) {
            dv[j].push_back(i);
        }
    }
    for (int i = 1; i < N; i ++) {
        for (int t: dv[e[i].w]) {
            ei[t].push_back(i);
        }
    }
    for (int i = 1; i <= N; i ++) {
        fath[i] = i;
        siz[i] = 1;
    }
    now = 0;
    for (int i = 1, d; i <= Q; i ++) {
        scanf("%d", &d);
        if (ans[d] == -1) {
            for (int j: ei[d]) {
                int x = get_fath(e[j].x);
                int y = get_fath(e[j].y);
                now += 1ll * siz[x] * siz[y];
                fath[x] = y;
                siz[y] += siz[x];
            }
            ans[d] = now;
            now = 0;
            for (int j: ei[d]) {
                fath[e[j].x] = e[j].x;
                siz[e[j].x] = 1;
                fath[e[j].y] = e[j].y;
                siz[e[j].y] = 1;
            }
        }
        printf("%lld\n", ans[d]);
    }
    return 0;
}