#include <bits/stdc++.h>
#define ll long long 
using namespace std;
const int N=2e5+10;
vector<int>e[N],hav[N];
int a[N];
ll f[N],g[N],h[N];
int sz[N],son[N],mu[N],d,n;
void dfs(int x,int fa){
    for(int v:e[x])if(v^fa){
        dfs(v,x);
        sz[x]+=sz[v];
        if(sz[v]>sz[son[x]])son[x]=v;
    }
    sz[x]++;
}
ll ans;

int ok[N];
ll pw(ll x,int cnt){
    ll ans=1;
    while(cnt){
        if(cnt&1)ans=ans*x;
        cnt>>=1;
        x*=x;
    }
    return ans;
}
ll gcd(ll x,ll y){
    if(!y)return x;
    return gcd(y,x%y);
}
int get(int t,int b){
    if(t==1)return 1;
    ll c=pw(t,d+1);
    c/=gcd(c,b);
    if(c<=n)return c;
    return 0;
}
void dfs(int x,int fa,int op){
    if(op==1){
        for(int v:e[x])if(v^fa)dfs(v,x,op);
        if(ok[a[x]]){
            // if(a[x]==13)cout<<ans<<"\n";
            for(int v:hav[a[x]])h[v]+=g[a[x]];
            for(int t:hav[a[x]]){
                ans+=mu[t]*h[get(t,a[x])]*g[a[x]];
                // if(a[x]==10)cout<<get(t,a[x])<<" "<<t<<"\n";
            }
        }
        
        return;
    }
    if(op==-1){
        if(ok[a[x]]){
            for(int t:hav[a[x]])ans-=mu[t]*h[get(t,a[x])]*g[a[x]];
            for(int v:hav[a[x]])h[v]-=g[a[x]];
        }
        for(int v:e[x])if(v^fa)dfs(v,x,op);
        return;
    }
    for(int v:e[x])if(v!=fa&&v!=son[x]){
        dfs(v,x,0);
        dfs(v,x,-1);
        // cout<<v<<" "<<ans<<"*\n";
    }
    
    // cout<<x<<" ";cout<<ans<<" ";
    if(son[x])dfs(son[x],x,0);
    // if(x==8)cout<<ans<<"\n";
    for(int v:e[x])if(v!=fa&&v!=son[x]){
        dfs(v,x,1);
        // if(x==8)cout<<a[v]<<" "<<ans<<" "<<h[5]<<"\n";
    }
    // if(x==8)cout<<ans<<"*\n";

    if(ok[a[x]]){
        for(int v:hav[a[x]])h[v]+=g[a[x]];
        for(int t:hav[a[x]]){
                ans+=mu[t]*h[get(t,a[x])]*g[a[x]];
            // if(a[x]==18)cout<<get(t,a[x])<<" "<<t<<" "<<h[get(t,a[x])]<<"\n";
        }
        
    }
    
    f[x]=ans;
}
int p[N],cnt,vis[N];
void init(){
    mu[1]=1;
    for(int i=2;i<=2e5;i++){
        if(!vis[i])p[++cnt]=i,mu[i]=-1;
        for(int j=1;j<=cnt&&(ll)p[j]*i<=2e5;j++){
            vis[p[j]*i]=1;
            mu[p[j]*i]=-mu[i];
            if(i%p[j]==0){
                mu[p[j]*i]=0;
                break;
            }
        }
    }
}
int get(int x){
    int ans=1;
     for(int j=1;p[j]*p[j]<=x;j++)if(x%p[j]==0){
        int cnt=0;
        while(x%p[j]==0)x/=p[j],cnt++;
        if(cnt&1)ans*=-1;
        if(cnt>d)ans=0;
    }
    if(x!=1)ans*=-1;
    return ans;
}
int main() {
    scanf("%d%d",&n,&d);
    init();
    for(int i=1;i<n;i++){
        int x,y;scanf("%d%d",&x,&y);
        e[x].push_back(y);
        e[y].push_back(x);
    }
    for(int i=1;i<=n;i++){
        g[i]=1;int x=i;ok[i]=1;
        for(int j=1;p[j]*p[j]<=x;j++)if(x%p[j]==0){
            int cnt=0;
            while(x%p[j]==0)x/=p[j],cnt++;
            if(cnt&1)g[i]*=-1;
            if(cnt>d)ok[i]=0;
        }
        if(x!=1)g[i]*=-1;
        // cout<<g[i]<<" "<<mu[i]<<"\n";
    }
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j+=i)hav[j].push_back(i);
    }
    // int t=0;
    // for(int i=1;i<=n;i++)if(i>3&&a[i]!=8&&a[i]!=16){
    //     for(int j=1;j<=a[i]*18;j++)if(a[i]*18%pw(j,d+1)==0){
    //         t+=mu[j]*g[a[i]]*g[18],cout<<j<<" "<<a[i]<<"\n";
    //     }

    //     // t+=g[a[i]];
    // }
    // cout<<t<<"\n";
    dfs(1,0);dfs(1,0,0);
    for(int i=1;i<=n;i++)printf("%lld\n",f[i]);
    return 0;
}