// Problem: A. t2
// Contest: undefined - NOIP2024训练赛 03
// URL: http://119.28.3.174/contest/1155/problem/573
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 2e5 + 10, M = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;

int n, m, q, ans, cnt;
int s[N], dp[N], siz[N];
bool vis[N];

vector<PII> e[N], v[N];
// map<PII, bool> mp;

void dfs(int now, int fa, int nd, int id)
{
	vis[now] = true, siz[id] ++;
	for(auto i : e[now])
	{
		if(i.fi == fa || i.se % nd) continue;
		dfs(i.fi, now, nd, id);
	}
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> q;
	for(int i = 1; i < n; i ++)
	{
		int u, v, w; cin >> u >> v >> w;
		e[u].push_back({v, w}), e[v].push_back({u, w});
	}
	while(q --)
	{
		int x; cin >> x; cnt = ans = 0;
		for(int i = 1; i <= n; i ++) vis[i] = false;
		for(int i = 1; i <= n; i ++) 
		{
			if(!vis[i]) 
			{
				siz[++ cnt] = 0;
				dfs(i, 0, x, cnt);
			}
		}
		for(int i = 1; i <= cnt; i ++) ans += siz[i] * (siz[i] - 1) / 2; 
		cout << ans << '\n';
	}
	return 0;
}