#include<bits/stdc++.h>

using namespace std;

const int maxn = 1e5 + 10;

int n, q;

struct Edge{
	int v, w;
};

vector<Edge> G[maxn];

map<int, int> p[maxn];

int cnt[maxn];

void dfs(int u, int fa) {
	p[u][-1] = 1;
	for (auto tmp: G[u]) {
		int v = tmp.v, w = tmp.w;
		if (v == fa) continue;
		dfs(v, u);
		map<int, int> res;
		for (auto vm: p[v]) {
			for (auto um: p[u]) {
				if (vm.first == -1 && um.first == -1) {
					res[w] += 1;
				} else if (vm.first == -1) {
					res[__gcd(w, um.first)] += um.second;
				} else if (um.first == -1) {
					res[__gcd(w, vm.first)] += vm.second;
				} else {
					res[__gcd(w, __gcd(vm.first, um.first))] += um.second * vm.second;
				}
			}
		}
		for (auto tmp: res) {
			cnt[tmp.first] += tmp.second;
		}
		for (auto vm: p[v]) {
			if (vm.first == -1) {
				p[u][w] += 1;
			} else {
				p[u][__gcd(w, vm.first)] += vm.second;
			}
		}
		p[u][-1] = 1;
	}
	
//	cout << u << " -----" << endl;
//	for (auto tmp: p[u]) {
//		cout << tmp.first << " " << tmp.second << endl;
//	}
}

int main() {
	cin >> n >> q;
	for (int i = 1; i <= n-1; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		G[u].push_back({v, w});
		G[v].push_back({u, w});
	}
	
	dfs(1, 0);
	
//	for (int i = 1; i < 30; i++) cout << i << " " << cnt[i] << endl; // 
	
	for (int i = 1; i < maxn; i++) {
		for (int j = 2*i; j < maxn; j += i) {
			cnt[i] += cnt[j];
		}
	}
	
	
	for (int i = 1; i <= q; i++) {
		int x;
		cin >> x;
		cout << cnt[x] << endl;
	}
}

/*

4 2
1 2 2
2 3 3
3 4 2
2
1

*/

/*

6 1
1 2 4
2 3 4
3 4 10
2 5 2
1 6 5
4

*/

/*

5 1
1 2 3
2 3 7
1 4 5
1 5 2
1

*/