#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define pi pair<ll, ll>
#define fi first
#define se second
//#define fi(x) (x->first)
//#define se(x) (x->second)
#define N 111111
ll sum[N], sz[N], nxt[N], d[N], fa[N], cnt[N], ans[N], n, q, u, v, w, mx;
vector<pi> g[N];
void add(int u, int v, int w, bool bj = 1){
	g[u].push_back({v, w});
	if(bj)
		add(v, u, w, 0);
}
void dfs(int u, int f){
	sz[u] = 1;
	for(auto x : g[u]){
		ll v = x.fi;
		if(v == f)
			continue;
		dfs(v, u);
		sz[u] += sz[v];
	}
	for(auto x : g[u])
		cnt[x.se] += sz[u] * (n - sz[u]);
}
void init(){
	for(int i = 1 ; i <= n ; i++)
		fa[i] = i, cnt[i] = 1;
}
ll find(int u){
	return fa[u] == u ? u : fa[u] = find(fa[u]);
}
void merge(int x, int y){
	int fx = find(x), fy = find(y);
	if(fx == fy)
		return;
	if(cnt[fx] < cnt[fy])
		swap(fx, fy);
	fa[fy] = fx;
	cnt[fx] += cnt[fy];
}
void print(){
	for(int i = 1 ; i <= q ; i++)
		printf("%lld\n", ans[i]);
}
int main(){
	scanf("%lld%lld", &n, &q);
	for(int i = 1 ; i < n ; i++){
		scanf("%lld%lld%lld", &u, &v, &w);
		add(u, v, w);
		mx = max(mx, w);
	}
	//dfs(1, 1);
	for(int i = 1 ; i <= q ; i++)
		scanf("%lld", &d[i]);
	if((q <= 50) && (n <= 50)){
		for(int i = 1 ; i <= q ; i++){
			init();
			for(int u = 1 ; u <= n ; u++)
				for(auto x : g[u]){
					int v = x.fi, w = x.se;
					if(w % d[i] == 0)
						merge(u, v);
				}
			for(int u = 1 ; u <= n ; u++)
				if(find(u) == u)
					ans[i] += cnt[u] * (cnt[u] - 1) / 2;
		}
		print();
		return 0;
	}
	if((max(*max_element(d + 1, d + 1 + n), mx) <= 100)){
		for(int i = 1 ; i <= q ; i++){
			if(sz[d[i]]){
				ans[i] = sz[d[i]];
				continue;
			}
			init();
			for(int u = 1 ; u <= n ; u++)
				for(auto x : g[u]){
					int v = x.fi, w = x.se;
					if(w % d[i] == 0)
						merge(u, v);
				}
			for(int u = 1 ; u <= n ; u++)
				if(find(u) == u)
					ans[i] += cnt[u] * (cnt[u] - 1) / 2;
			sz[d[i]] = ans[i];
		}
		print();
		;
		return 0;
	}
	return 0;
}
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);

*/