#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200010
ll n,d;ll a[N];
vector<ll>e[N],ji[N];
ll zhi[N],mo[N];ll cnt=0;
bool vis[N];
ll val[N];
inline void init(){
    mo[1]=1;for(int i=2;i<=n;i++){
        if(!vis[i])zhi[++cnt]=i,mo[i]=-1;
        for(int j=1;zhi[j]*i<=n&&j<=cnt;j++){
            vis[i*zhi[j]]=1;if(i%zhi[j]==0)break;
            mo[i*zhi[j]]=-mo[i];
        }
    }for(int i=1;i<=cnt;i++)for(int j=zhi[i];j<=n;j+=zhi[i])ji[j].push_back(zhi[i]);
    for(int i=1;i<=n;i++){
        val[i]=1;for(auto o:ji[i]){
            if(o!=1&&!vis[o]){
                ll g=0,nw=i;while(nw%o==0)nw/=o,g++;
                if(g>d){val[i]=0;break;}if(g&1)val[i]=-val[i];
            }
        }
    }return ;
}
ll ans[N],sum[N],s1[N];
ll top[N],siz[N],son[N],dep[N],faa[N];
inline ll suan(ll x){
    for(auto o:ji[x]){
        ll g=0,nw=x;while(nw%o==0)nw/=o,g++;
        if(g+g>d)return 0;
    }return val[x]*val[x];
}
inline void dfs(ll x,ll fa){
    faa[x]=fa;dep[x]=dep[fa]+1;siz[x]=1;sum[x]+=val[a[x]];s1[x]=suan(a[x]);for(auto o:e[x]){
        if(o==fa)continue;
        dfs(o,x);sum[x]+=sum[o];siz[x]+=siz[o];s1[x]+=s1[o];
        if(siz[o]>siz[son[x]])son[x]=o;
    }return ;
}
ll dfn[N],dfncnt=0;
inline void dfs1(ll x,ll tp){
    dfn[x]=++dfncnt;top[x]=tp;if(son[x]){
        dfs1(son[x],tp);
    }for(auto o:e[x]){
        if(!top[o])dfs1(o,o);
    }return ;
}
inline ll lca(ll x,ll y){
    while(top[x]!=top[y]){
        if(dep[top[x]]<dep[top[y]])swap(x,y);
        x=faa[top[x]];
    }if(dep[x]<dep[y])swap(x,y);
    return y;
}
vector<ll>ex[N];
ll v1[N],v2[N],hs[N],rc[N];
ll tem[N<<1];ll cn=0;
inline bool cmp(ll x,ll y){return dfn[x]<dfn[y];}
inline void build(){
    sort(tem+1,tem+cn+1,cmp);cn=unique(tem+1,tem+cn+1)-tem-1;
    ll pre=cn;for(int i=1;i<pre;i++)tem[++cn]=lca(tem[i],tem[i+1]);
    sort(tem+1,tem+cn+1,cmp);cn=unique(tem+1,tem+cn+1)-tem-1;
    for(int i=2;i<=cn;i++)ex[lca(tem[i-1],tem[i])].push_back(tem[i]);
    return ;
}
ll pos[N];
inline void gt(ll x){
    for(auto o:ex[x]){
        gt(o);hs[x]-=v1[o]*v2[o];v1[x]+=v1[o];v2[x]+=v2[o];
    }hs[x]+=v1[x]*v2[x];
    return ;
}
inline void clear(ll tp){for(int i=1;i<=cn;i++)rc[tem[i]]+=tp*hs[tem[i]],hs[tem[i]]=v1[tem[i]]=v2[tem[i]]=0,ex[tem[i]].clear();cn=0;return ;}
inline void dfs2(ll x,ll fa){
    for(auto o:e[x])if(o!=fa)dfs2(o,x),rc[x]+=rc[o];
    return ;
}
ll tot=0;
inline ll solve(ll x,ll y){
    for(int i=1;i<=cnt;i++){
        ll nw=x,g=0;while(nw%zhi[i]==0)nw/=zhi[i],g++;
        nw=y;while(nw%zhi[i]==0)nw/=zhi[i],g++;if(g>d)return 0;
    }return val[x]*val[y];
}
ll xu[N],cnn=0;
inline void dfs(ll pp,ll x,ll y,ll tp){
    if(x>n||y>n)return ;
    if(pp==cnn+1){
        // cout<<x<<' '<<y<<'\n';
        for(int i=x;i<=n;i+=x)if(__gcd(y,(ll)i/x)==1){v1[pos[i]]+=val[i];tem[++cn]=pos[i];}
        for(int i=y;i<=n;i+=y)v2[pos[i]]+=val[i],tem[++cn]=pos[i];
        build();gt(tem[1]);
        clear(tp);
        return ;
    }for(int j=1;j<=d;j++)y*=xu[pp];x*=xu[pp];
    for(int j=1;j<=d;j++){
        dfs(pp+1,x,y,tp);
        x=x*xu[pp];y/=xu[pp];
    }return ;
}
int main(){
    // freopen("test1.in","r",stdin);
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>d;init();for(int i=1,u,v;i<n;i++)cin>>u>>v,e[u].push_back(v),e[v].push_back(u);for(int i=1;i<=n;i++)cin>>a[i],pos[a[i]]=i;
    dfs(1,0);dfs1(1,1);
    for(int i=1;i<=n;i++)ans[i]=sum[i]*sum[i]+s1[i];
    // for(int i=1;i<=n;i++)cout<<s1[i]<<' ';cout<<'\n';
    for(int i=2;i<=n;i++){
        if(!mo[i])continue;
        ll nw=1;for(int j=1;j<=d+1&&nw<=n*n;j++)nw=nw*i;
        if(nw>n*n)break;
        cnn=0;for(auto o:ji[i])xu[++cnn]=o;
        dfs(1,1,1,mo[i]);
    }dfs2(1,0);for(int i=1;i<=n;i++)ans[i]+=rc[i];
    // for(int i=1;i<=n;i++)cout<<i<<' '<<rc[i]<<'\n';
    for(int i=1;i<=n;i++)cout<<ans[i]/2<<'\n';
    return 0;
}