#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int N = 1e5 + 5;

int ans[N];

vector<pair<int, int> >G[N];

void dfs(int u, int fa, int d){
    ans[d]++;
    for(int i = 0; i < G[u].size(); i++){
        pair<int, int>pii = G[u][i];
        int v = pii.first, w = pii.second;
        if(v == fa) continue;
        dfs(v, u, __gcd(d, w));
    }
}

void solve(){
    int n, q;
    cin >> n >> q;
    for(int i = 1; i < n; i++){
        int u, v, w;
        cin >> u >> v >> w;
        G[u].push_back({v, w});
        G[v].push_back({u, w});
    }
    for(int i = 1; i <= n; i++) dfs(i, 0, 0);
    for(int i = 1; i <= n; i++){
        for(int j = i * 2; j <= n; j += i){
            ans[i] += ans[j];
        }
    }
    for(int i = 1; i <= q; i++){
        int d;
        cin >> d;
        cout << ans[d] / 2 << '\n';
    }
}

int main(){
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}