#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e5+5; 
int n, d, v[N], pr[N], pc, sz[N], gs[N], a[N];
ll f[N], ans[N], cs[N]; 
vector <int> e[N], tx, dv[N], td[N];  

inline int F (int x) {
	int res = 1; 
	while (x > 1) {
		int k = v[x], c = 0; 
		while (x%k == 0) {
			++c; res = -res; x /= k; 
		}
	}
	return res; 
}

void init (int n) {
	for (int i = 2;i <= n;i++) {
		if (!v[i]) { v[i] = i; pr[++pc] = i; }
		for (int j = 1;j <= pc && pr[j]*i <= n;j++) {
			v[pr[j]*i] = pr[j]; 
			if (pr[j] == v[i]) break; 
		}
	}
	for (int i = 1;i <= n;i++) for (int j = i;j <= n;j += i) dv[j].pb(i); 
	for (int i = 1;i <= n;i++) {
		int x = i; 
		while (x > 1) {
			int k = v[x], c = 0; 
			while (x%k == 0) {
				++c; x /= k; 
			}
			ll v = 1; 
			int q = max(d+1-c, 0); 
			while (q--) {
				v = min(1ll*n+1, v*k); 
			}
			td[i].pb(v); 
		}
	}
}


void dfs (int p, int fa) {
	sz[p] = 1; 
	for (int i : e[p]) {
		if (i == fa) continue;
		dfs(i, p); sz[p] += sz[i]; 
		if (sz[i] > sz[gs[p]]) gs[p] = i; 
	}
}

ll res; 
void del (int p, int fa) {
	for (int j : dv[a[p]]) cs[j] -= f[a[p]]; 
	for (int i : e[p]) {
		if (i == fa) continue; 
		del(i, p); 
	}
}
void ad (int k) {
	for (int j : dv[k]) cs[j] += f[k]; 
	for (int j = 0;j < (1<<td[k].size());j++) {
		ll v = 1; 
		for (int z = 0;z < td[k].size();z++) {
			if (j>>z&1^1) continue; 
			v = min(1ll*n+1, v*td[k][z]); 
		}
		if (__builtin_popcount(j)&1) res -= f[k]*cs[v]; else res += f[k]*cs[v]; 
	}
}

void add (int p, int fa) {
	ad(a[p]); 
	for (int i : e[p]) {
		if (i == fa) continue; 
		add(i, p); 
	}
}

void dfs2 (int p, int fa) {
	for (int i : e[p]) {
		if (i == fa || i == gs[p]) continue; 
		dfs2(i, p); del(i, p); res = 0; 
	}
	if (gs[p]) dfs2(gs[p], p); 
	ad(a[p]); 
	for (int i : e[p]) {
		if (i == fa || i == gs[p]) continue;
		add(i, p);  
	}
	ans[p] = res; 
}

void solve () {
	cin >> n >> d;
	init(n); 
	for (int i = 1;i <= n;i++) f[i] = F(i); 
	for (int i = 1;i < n;i++) {
		int x, y; cin >> x >> y; 
		e[x].pb(y); e[y].pb(x); 
	}
	for (int i = 1;i <= n;i++) cin >> a[i]; 
	dfs(1, 0);
	dfs2(1, 0); 
	for (int i = 1;i <= n;i++) cout << ans[i] << "\n"; 
}

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	solve(); 
	return 0;
}