#pragma GCC optimize("Ofast","inline")
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=5e5+500,M=2e7+19260+817;

struct node
{
	int u,v,nxt;
}e[N];

int n,d,head[N],cnt,pri[N],cc,a[N],fir[N],f[N],mx[N],tot,tl[M],tr[M],sa[M],sb[M],ro[N],ans[N],sz[N];ll sum[M];
vector<pair<ll,ll>>p[N];vector<int>in[N];int st[N],top;

void init()
{
	for(int i=2;i<=n;i++)
	{
		if(!a[i])pri[++cc]=fir[i]=i;
		for(int j=1;j<=cc&&i*pri[j]<=n;j++)
		{
			a[i*pri[j]]=1;fir[i*pri[j]]=pri[j];
			if(i%pri[j]==0)break;
		}
	}
	p[1].push_back(make_pair(1,1));f[1]=1;
	for(int i=2;i<=n;i++)
	{
		int num=0,x=i;ll k=1;
		while(x%fir[i]==0)++num,x/=fir[i];
		mx[i]=max(mx[x],num);
		if(mx[i]<=d)f[i]=-f[i/fir[i]];
		else continue;
		for(int j=1;j<=d-num+1&&k<=n;j++)k*=fir[i];
		for(auto t:p[x])
		{
			p[i].push_back(t);
			t.first*=k;t.second*=-1;
			if(t.first<=n)p[i].push_back(t);
		}
	}
	for(int i=1;i<=n;i++)for(int j=i;j<=n;j+=i)in[j].push_back(i);
}

#define mid ((l+r)>>1)

void add(int&x)
{
	if(top)x=st[top--];
	else x=++tot;
}

void insert(int&x,int l,int r,int d,int da,int db)
{
	if(!x)add(x);
	if(l==r)
	{
		sa[x]+=da;sb[x]+=db;sum[x]=1ll*sa[x]*sb[x];
		return;
	}
	if(d<=mid)insert(tl[x],l,mid,d,da,db);
	else insert(tr[x],mid+1,r,d,da,db);
	sum[x]=sum[tl[x]]+sum[tr[x]];
}

void erase(int x)
{
	st[++top]=x;tl[x]=tr[x]=sum[x]=sa[x]=sb[x]=0;
}

void merge(int&a,int b,int l,int r)
{
	if(!a||!b)return void(a=a+b);
	if(l==r)
	{
		sa[a]+=sa[b];sb[a]+=sb[b];sum[a]=1ll*sa[a]*sb[a];
		return;
	}
	merge(tl[a],tl[b],l,mid);merge(tr[a],tr[b],mid+1,r);
	sum[a]=sum[tl[a]]+sum[tr[a]];erase(b);
}

void dfs(int x,int fa)
{
	add(ro[x]);sz[x]=(mx[a[x]]*2<=d?1:0);
	if(f[a[x]])for(auto t:p[a[x]])insert(ro[x],1,n,t.first,f[a[x]]*t.second,0);
	if(f[a[x]])for(auto t:in[a[x]])insert(ro[x],1,n,t,0,f[a[x]]);
	for(int i=head[x];i;i=e[i].nxt)
	{
		int v=e[i].v;
		if(v==fa)continue;
		dfs(v,x);sz[x]+=sz[v];
		merge(ro[x],ro[v],1,n);
	}
	ans[x]=sum[ro[x]]+sz[x];
}

int main()
{
	// freopen("in","r",stdin);
	// freopen("out","w",stdout);
	cin>>n>>d;
	init();
	for(int i=1;i<n;i++)
	{
		int u,v;cin>>u>>v;
		e[++cnt]=(node){u,v,head[u]};head[u]=cnt;
		e[++cnt]=(node){v,u,head[v]};head[v]=cnt;
	}
	for(int i=1;i<=n;i++)cin>>a[i];
	dfs(1,0);
	for(int i=1;i<=n;i++)cout<<ans[i]/2<<'\n';
}