#include <bits/stdc++.h> // 这下是自己写的了（ 
using namespace std;

const int N = 1e5 + 5;

struct node {
	int u, v, w;
} e[N];

int fa[N], siz[N], f[N];
bool vis[N];

int find(int x) {
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}

int main() {
	cin.tie(0); ios::sync_with_stdio(0);
	int n, q; cin >> n >> q;
	for (int i = 1; i < n; i++) {
		int u, v, w; cin >> u >> v >> w;
		e[i].u = u, e[i].v = v, e[i].w = w;
	}
	
	for (int d = 1; d <= 100; d++) {
		int cnt = 0;
		for (int i = 1; i <= n; i++) {
			fa[i] = i; siz[i] = 1;
			vis[i] = 0;
		}
		for (int i = 1; i < n; i++) {
			if (e[i].w % d == 0) {
				int fx = find(e[i].u), fy = find(e[i].v);
				if (fx != fy) {
					fa[fx] = fy;
					siz[fy] += siz[fx];
				}
			}
		}
		for (int i = 1; i <= n; i++) {
			bool &x = vis[find(i)];
			if (!x) {
				x = 1;
				cnt += siz[find(i)] * (siz[find(i)] - 1) / 2;
			}
		}
		
		f[d] = cnt;
	}
	
	while (q--) {
		int d, cnt = 0; cin >> d;
		if (d <= 100) cout << f[d] << "\n";
		else {
			int cnt = 0;
			for (int i = 1; i <= n; i++) {
				fa[i] = i; siz[i] = 1;
				vis[i] = 0;
			}
			for (int i = 1; i < n; i++) {
				if (e[i].w % d == 0) {
					int fx = find(e[i].u), fy = find(e[i].v);
					if (fx != fy) {
						fa[fx] = fy;
						siz[fy] += siz[fx];
					}
				}
			}
			for (int i = 1; i <= n; i++) {
				bool &x = vis[find(i)];
				if (!x) {
					x = 1;
					cnt += siz[find(i)] * (siz[find(i)] - 1) / 2;
				}
			}
				
			f[d] = cnt;
			cout << f[d] << "\n";
		}
	}
}