#include <bits/stdc++.h>
using namespace std;
#define FILE(x) freopen(x".in", "r", stdin);freopen(x".out", "w", stdout);
int n, q, k;
long long ans[100001], son[100001];
vector <pair <int, int> > e[100001];
bool vis[100001];
void dfs(int x){
	if (vis[x]){
		return;
	}
	son[x] = 1;
	vis[x] = true;
	for (auto u : e[x]){
		if (!(u.second % k)){
			if (vis[u.first]){
				continue;
			}
			dfs(u.first);
			ans[k] += son[x] * son[u.first];
			son[x] += son[u.first];
		}
	}
	return;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int u, v, w, d;
	cin >> n >> q;
	for (int i = 1; i < n; i++){
		cin >> u >> v >> w;
		e[u].push_back({v, w});
		e[v].push_back({u, w});
	}
	for (int i = 1; i <= 1e5; i++){
		ans[i] = -1;
	}
	while (q--){
		cin >> d;
		if (ans[d] != -1){
			cout << ans[d] << "\n";
		} else {
			k = d;
			ans[d] = 0;
			for (int i = 1; i <= n; i++){
				dfs(i);
				vis[i] = false;
			}
			cout << ans[d] << "\n";
		}
	}
	return 0;
}