#include<iostream>
#include<vector>
using namespace std;
vector<pair<int,int> > tree[112310];
int a[114151];
int k;
int dfs(int p,int val){
	if(tree[p].empty()){
		return a[p] = val;
	}
	int sum = 0;
	bool f = 1;
	for(auto v:tree[p]){
		if(v.second%k==0){
			f = 0;
			sum+=dfs(v.first,val+1);
		}
	}
	if(f){
		return val;
	}
	else{
		return sum;
	}
}
int main(){
	int n,q;
	cin>>n>>q;
	for(int i=1;i<n;i++){
		int u,v,x;
		cin>>u>>v>>x;
		tree[u].push_back(make_pair(v,x));
	}
	for(int i=1;i<=q;i++){
		cin>>k;
		cout<<dfs(1,0)*2<<endl;
	}
	return 0;
}