#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
// #define int ll
// #define N 
using namespace std;
const int N=200005;
int siz[N],son[N];
poly F[N],G[N],Z[N],all[N];
int n,m;
bool vis[N];
ll ans[N];
int val[N];
int pw[N][21];
int a[N],cnt[N],od[N];
ll res;
inline ll quickPower(ll x,ll y)
{
    ll res=1;
    while (y)
    {
        if (y&1) 
        {
            res=min(1ll*n+1,1ll*res*x);
        }
        x=min(1ll*n+1,1ll*x*x);
        y>>=1;
    }
    return res;
}
void dfs(int k,int fa)
{
    for (auto u:G[k])
    {
        if (u==fa) continue;
        dfs(u,k);
        siz[k]+=siz[u];
        if (siz[u]>siz[son[k]]) son[k]=u;
    }
    siz[k]+=1;
}
int b[N],nxt[N],DFN,idfn[N];
void dfss(int k,int fa)
{
    b[++DFN]=a[k];
    idfn[DFN]=k;
    int x=DFN;
    for (auto u:G[k])
    {
        if (u==fa||u==son[k]) continue;
        dfss(u,k);
    }
    if (son[k]) dfss(son[k],k);
    nxt[x]=DFN;
}
void ins(int x)
{
    int tmp=x;
    for (int j=sz(all[x])-1;j>=0;j--)
        if (all[x][j]>m) return;

    for (auto u:F[x])
        cnt[u]+=val[x];
    for (int i=0;i<(1<<sz(all[x]));i++)
    {
        ll d=1;
        int coef=1;
        for (int j=sz(all[x])-1;j>=0;j--)
            if ((i>>j)&1)
            {
                coef=-coef;
                d=1ll*d*pw[Z[x][j]][m-all[x][j]+1];
                if (d>n) break;
            }
        if (d<=n)
            res+=1ll*val[x]*coef*cnt[d];
    }
}
void dfs1(int x)
{
    // cout<<x<<","<<nxt[x]<<endl;
    int l=x;
    for (int i=x+1;i<=nxt[x];)
    {
        dfs1(i);
        if (nxt[i]!=nxt[x])
        {
            for (int j=i;j<=nxt[i];j++)
                for (auto u:F[b[j]]) cnt[u]=0;
            res=0;
        } else l=i-1;

        i=nxt[i]+1;
    }
    // cout<<"!"<<x<<","<<l<<endl;
    for (int i=x;i<=l;i++)
    {
        ins(b[i]);
    }
    ans[idfn[x]]=res;
}
mt19937_64 rnd(time(0));
const int B=1000;
inline int rndd(int l,int r)
{
    return rnd()%(r-l+1)+l;
}
void BellaKira()
{
    cin>>n>>m;
    // m=2;
    for (int i=1;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    vis[1]=1;
    for (int i=1;i<=n;i++)
    {
        for (int j=i;j<=n;j+=i) F[j].push_back(i);
        if (!vis[i])
        {
            if (quickPower(i,m/2)<=n)
            {
                for (int j=i;j<=n;j+=i) Z[j].push_back(i);
            }
            pw[i][0]=1;
            for (int j=1;j<=m;j++) pw[i][j]=min(1ll*n+1,1ll*pw[i][j-1]*i);
            for (int j=i+i;j<=n;j+=i) vis[j]=1;
        }
    }
    for (int x=1;x<=n;x++)
    {
        val[x]=1;
        if (F[x].size()>=2) val[x]=-val[x/F[x][1]];
        int tmp=x;
        for (int i=0;i<sz(Z[x]);i++)
        {
            int u=Z[x][i];
            int t=0;
            while (tmp%u==0) t++,tmp/=u;
            all[x].push_back(t);
        }
    }
    for (int i=1;i<=n;i++) cin>>a[i];
    dfs(1,0);
    dfss(1,0);
    dfs1(1);
    for (int i=1;i<=n;i++) cout<<ans[i]<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/