#include<bits/stdc++.h>
#define PII pair<int,int>
#define ll long long
using namespace std;
//char buf[1<<23],*p1=buf,*p2=buf;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
template <typename T> inline void read(T &x){x=0;int f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();x*=f;}
template <typename T> inline void write(T x){if(x>9)write(x/10);putchar(x%10+'0');}
const int N=2e5+10;
int n,m,prime[N],f[N],g[N],mu[N],u[N],v[N],a[N],mx[N],vis[N];
ll t[N],now,s[N];
vector<int> G[N];
basic_string<int> d[N];
basic_string<PII> d2[N];
int fa[N],L[N],R[N],tot,iv[N],siz[N],son[N],ans[N];
basic_string<int> tmp;
void dfs1(int u,int f){
	fa[u]=f,L[u]=++tot,iv[tot]=u,siz[u]=1;
	for(auto v:G[u])if(v^f)dfs1(v,u),siz[u]+=siz[v],son[u]=siz[v]>siz[son[u]]?v:son[u];
	R[u]=tot;
}
void add(int x){if(f[x]){tmp+=x;for(auto y:d[x])s[y]+=g[x];}}
ll ask(int x){
	ll res=0;
	for(auto y:d2[x])res+=mu[y.first]*s[y.second];
	return res*g[x];
}
void dfs2(int u){
	for(auto v:G[u])
		if(v^fa[u]&&v^son[u]){
			ll tp=now;
			dfs2(v),now=tp;
			for(auto x:tmp)for(auto y:d[x])s[y]=0;
			tmp.clear();
		}
	if(son[u])dfs2(son[u]);
	add(u),now+=ask(u);
	for(auto v:G[u])
		if(v^fa[u]&&v^son[u])
			for(int i=L[v];i<=R[v];++i)add(iv[i]),now+=ask(iv[i]);
	ans[u]=now;
}
int main(){
	read(n),read(m);
	for(int i=1;i<n;++i)read(u[i]),read(v[i]);
	for(int i=1;i<=n;++i)read(a[i]);
	for(int i=1;i<n;++i)G[a[u[i]]].push_back(a[v[i]]),G[a[v[i]]].push_back(a[u[i]]);
	g[1]=mu[1]=1;
	for(int i=2;i<=n;++i){
		if(!g[i])g[i]=mu[i]=-1,prime[++prime[0]]=i,mx[i]=i;
		for(int j=1;j<=prime[0]&&prime[j]*i<=n;++j){
			mx[prime[j]*i]=prime[j],g[prime[j]*i]=-g[i];
			if(!(i%prime[j]))break;
			mu[prime[j]*i]=-mu[i];
		}
	}
	for(int i=1;i<=n;++i)for(int j=i;j<=n;j+=i)d[j]+=i;
	for(int i=1;i<=n;++i){
		ll tp=1;
		for(int j=1;j<=m+1;++j)tp*=i;
		if(tp>1ll*n*n)break;
		t[i]=tp;
	}
	for(int i=1;i<=n;++i){//枚举b
		f[i]=1;
		static int cnt[N];
		for(int x=i;x^1;x/=mx[x])++cnt[mx[x]],f[i]&=cnt[mx[x]]<=m;
		for(int x=i;x^1;x/=mx[x])cnt[mx[x]]=0;
		for(auto j:d[i])
			if(t[j]&&mu[j]){
				ll tp=1ll*t[j]/__gcd(t[j],1ll*i);
				if(tp<=n)d2[i]+={j,tp},vis[tp]=1;
			}
		d[i].clear();
	}
	for(int i=1;i<=n;++i)if(vis[i])for(int j=i;j<=n;j+=i)d[j]+=i;
	dfs1(a[1],0),dfs2(a[1]);
	for(int i=1;i<=n;++i)write(ans[a[i]]),putchar('\n');
	return 0;
}