#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+5;
vector<int> g[N],g1[N];
ll sum,su,f[N],c[N],pw[N];bool t[N];
int n,d,p[N],sz[N],son[N],s[N],a[N],mu[N];
int head[N],cnt;struct node{int to,nxt;}e[N<<1];
void add(int u,int v){e[++cnt]={v,head[u]},head[u]=cnt;}
int ksm(int a,int b){int s=1;
	for(;b;b>>=1,a*=a){
		if(b&1){if(1ll*s*a>n)return n+1;s*=a;}
		if(1ll*a*a>n&&b/2!=0)return n+1;
	}
	return s;
}
void init(int u,int fa){sz[u]=1;
	for(int i=head[u],v;i;i=e[i].nxt)if((v=e[i].to)!=fa){
		init(v,u),sz[u]+=sz[v];
		if(sz[v]>sz[son[u]])son[u]=v;
	}
}
void insert(int u){ll tot=0;
	tot+=su;int i=0;
	for(auto x:g[p[u]]){
		int y=p[u],cnt=d+1-g1[p[u]][i];
		tot+=mu[x]*c[ksm(x,cnt)];
//		cout<<"  "<<u<<" "<<mu[x]<<" "<<c[ksm(x,cnt)]<<" "<<ksm(x,cnt)<<" "<<x<<" "<<cnt<<endl;
	}
	sum+=a[u]*tot,su+=a[u];
//	cout<<sum<<" "<<su<<endl;
	for(auto x:g[p[u]])c[x]+=a[u];//cout<<" "<<u<<" "<<x<<" "<<a[u]<<endl;;
}
void del(int u){su=0;for(auto x:g[p[u]])c[x]=0;}
void ins(int u,int fa){insert(u);for(int i=head[u],v;i;i=e[i].nxt)if((v=e[i].to)!=fa)ins(v,u);}
void clr(int u,int fa){del(u);for(int i=head[u],v;i;i=e[i].nxt)if((v=e[i].to)!=fa)clr(v,u);}
void dfs(int u,int fa){
	for(int i=head[u],v;i;i=e[i].nxt)if((v=e[i].to)!=fa&&v!=son[u])dfs(v,u),s[u]+=s[v],sum=su=0,clr(v,u);
	if(son[u])dfs(son[u],u),s[u]+=s[son[u]];
	for(int i=head[u],v;i;i=e[i].nxt)if((v=e[i].to)!=fa&&v!=son[u])ins(v,u);
//	cout<<endl;
	insert(u),f[u]=sum+s[u];
//	cout<<u<<" "<<sum<<" "<<s[u]<<" "<<p[u]<<endl;
//	for(int i=1;i<=n;i++)cout<<c[i]<<" ";
//	cout<<endl;
}
int main(){
	scanf("%d%d",&n,&d);
	for(int i=1,x,y;i<n;i++)scanf("%d%d",&x,&y),add(x,y),add(y,x);
	for(int i=1;i<=n;i++)scanf("%d",&p[i]),pw[i]=ksm(i,d),t[pw[i]]=1;
	for(int i=1;i<=n;i++){mu[i]+=i==1;for(int j=i+i;j<=n;j+=i)mu[j]-=mu[i];}
	for(int i=2;i<=n;i++)for(int j=i;j<=n;j+=i)g[j].push_back(i);
	for(int i=1;i<=n;i++){s[i]=a[i]=1;
		long long y=1ll*p[i]*p[i],z=p[i];
		for(auto x:g[p[i]]){int cnt=0,ct1=0;
			while(y%x==0)cnt++,y/=x;
			while(z%x==0)ct1++,z/=x;
			if(cnt>d)s[i]=0;else s[i]*=((cnt&1)?-1:1);
			if(ct1>d)a[i]=0;else a[i]*=((ct1&1)?-1:1);
		}
		for(auto x:g[p[i]]){int cnt=0,y=p[i];
			while(y%x==0)cnt++,y/=x;
			g1[p[i]].push_back(cnt);
		}
//		cout<<a[i]<<" "<<s[i]<<endl;
	}
	init(1,0),dfs(1,0);
	for(int i=1;i<=n;i++)printf("%d\n",f[i]);//cout<<i<<endl;
	return 0;
}