// Not afraid to dark.

#include <bits/stdc++.h>
using namespace std;

#define int long long

#define inline __inline__ __attribute__ ((always_inline))

namespace io {
	int pos;
	inline int read (int &p = pos){
		static int v; static char c;
		v = 1, c = getchar (), p = 0;
		while (! isdigit (c)){
			if (c == '-')
				v = - 1;
			c = getchar ();
		}
		while (isdigit (c)){
			p = (p << 1) + (p << 3) + (c - 48);
			c = getchar ();
		}
		return p *= v;
	}
	inline void write (int x){
		if (x < 0)
			putchar ('-'), x = - x;
		static int sta[65], top;
		top = 0;
		do {
			sta[++ top] = x % 10;
			x /= 10;
		} while (x);
		while (top)
			putchar (sta[top --] + 48);
	}
	inline char next_char (){
		static char c;
		c = getchar ();
		while (c == '\n' || c == ' ' || c == '\r')
			c = getchar ();
		return c;
	}
	inline void putss (const string s){
		for (int i = 0;i < (int) s.size ();++ i)
			putchar (s[i]);
	}
};

const int N = 2e5, LG = 20, inf = 2e18;

int n, d, a[N + 5];
int firs[N + 5], nex[N * 2 + 5], to[N * 2 + 5], tot;
int sz[N + 5], son[N + 5];
vector < pair < int , int > > fac[N + 5];
bool not_prime[N + 5];
int g[N + 5], mu[N + 5], prime[N + 5], cnt;
inline void Add (int u, int v){
	++ tot;
	nex[tot] = firs[u];
	firs[u] = tot;
	to[tot] = v;
	++ tot;
	nex[tot] = firs[v];
	firs[v] = tot;
	to[tot] = u;
}
void init (int u, int father){
	sz[u] = 1;
	for (int e = firs[u], v;e;e = nex[e]){
		v = to[e];
		if (v == father)
			continue;
		init (v, u);
		if (sz[son[u]] < sz[v])
			son[u] = v;
		sz[u] += sz[v];
	}
}

inline int power (int a, int p){
	int res = 1;
	while (p > 0){
		if (p & 1){
			if (inf / a < res)
				return inf;
			res = res * a;
		}
		if (p == 1)
			break;
		if (inf / a < a)
			return inf;
		a = a * a;
		p >>= 1;
	}
	return res;
}

int ans[N + 5];
int bel[N + 5];
vector < int > st[N + 5];
bool tag[N + 5];
int sta[LG + 5], top, ton[LG + 5][N + 5], rep[N + 5];
inline void Init (){
	top = 0;
	for (int i = LG;i >= 1;-- i)
		sta[++ top] = i;
}
inline void release (int x){ sta[++ top] = x;}
inline int new_R (){return sta[top --]; }
inline void ad (int v, int r, int vt = 1){
	for (auto &x : fac[v])
		ton[r][x.first] += g[v] * vt;
}
int U;
inline int Calc (int v, int r){
	static int t, p, res; res = 0;
	int ress = 0;
	for (int x : st[bel[U]])
		ress += mu[x * v];
	for (auto x : fac[v]){
		tie (t, p) = x;
		if (p > n)
			continue;
		res += ton[r][p] * mu[t];
	}
	res *= g[v];
	return res;
}

void Solve (int u, int father){
	if (son[u])
		Solve (son[u], u), ans[u] += ans[son[u]];
	if (son[u] == 0)
		rep[u] = new_R (), bel[u] = u;
	else
		rep[u] = rep[son[u]], bel[u] = bel[son[u]];
	U = u;
	if (! tag[a[u]]){
		ad (a[u], rep[u]);
		st[bel[u]].push_back (a[u]);
		ans[u] += Calc (a[u], rep[u]);
	}
	for (int e = firs[u], v;e;e = nex[e]){
		v = to[e];
		if (v == father || v == son[u])
			continue;
		Solve (v, u);
		U = u;
		for (int x : st[bel[v]]){
			ad (x, rep[v], - 1);
			ans[u] += Calc (x, rep[u]);
			st[bel[u]].push_back (x);
		}
		for (int x : st[bel[v]])
			ad (x, rep[u]);
		st[bel[v]].clear ();
		release (rep[v]);
		ans[u] += ans[v];
	}
}

signed main (){
	io::read (n), io::read (d);
	for (int i = 1;i < n;++ i)
		Add (io::read (), io::read ());
	for (int i = 1;i <= n;++ i)
		io::read (a[i]);
	for (int i = 1;i <= n;++ i)
		for (int j = 1;i * j <= n;++ j)
			fac[i * j].push_back (make_pair (i, power (i, d + 1) / __gcd (power (i, d + 1), i * j)));
	g[1] = mu[1] = 1;
	for (int i = 2;i <= n;++ i){
		if (! not_prime[i])
			prime[++ cnt] = i, g[i] = - 1, mu[i] = - 1;
		for (int j = 1;j <= cnt && prime[j] * i <= n;++ j){
			g[i * prime[j]] = g[i] * g[prime[j]];
			not_prime[i * prime[j]] = true;
			if (i % prime[j] == 0)
				break;
			mu[i * prime[j]] = - mu[i];
		}
	}
	for (int i = 2, x;i <= n;++ i)
		if ((x = power (i, d + 1)) <= n)
			tag[x] = true;
	for (int i = 2;i <= n;++ i)
		if (tag[i])
			for (int j = 1;i * j <= n;++ j)
				tag[i * j] = true;
	Init ();
	init (1, 0);
	Solve (1, 0);
	for (int i = 1;i <= n;++ i)
		io::write (ans[i]), putchar ('\n');
	return 0;
}