#include <bits/stdc++.h>
#define ALL(x) begin(x), end(x)
#define All(x, l, r) &x[l], &x[(r) + 1]
using namespace std;
void file(){
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
}
using ll = long long;
const int nMax = 2e5 + 5, mod = 998244353;
int n, d, lm;
array<vector<int>, nMax> tr, fc;
array<int, nMax> a, sz, sn, t, g, mu, r;
array<ll, nMax> pw;
void dfs(int x, int F){
  sz[x] = 1;
  for(int to : tr[x]) if(to ^ F){
    dfs(to, x); sz[x] += sz[to];
    if(sz[sn[x]] < sz[to]) sn[x] = to;
  }
}
void init(){
  for(int i = 1; i <= n; i++){
    for(int j = i; j <= n; j += i) fc[j].push_back(i);
  }
  vector<bool> ispr(n + 1, 1);
  vector<int> vp;
  mu[1] = g[1] = 1;
  for(int i = 2; i <= n; i++){
    if(ispr[i]){ vp.push_back(i); mu[i] = g[i] = -1; }
    for(int P : vp){
      if(i * P > n) break;
      ispr[i * P] = 0; g[i * P] = -g[i];
      if(!(i % P)) break;
      mu[i * P] = -mu[i];
    }
  }
  lm = n + 1;
  for(int i = 1; i <= n; i++){
    if(powl(i, d + 1) > (ll)n * n){ lm = i; break; }
    pw[i] = 1; for(int j = 0; j <= d; j++) pw[i] *= i;
  }
}
int upd(int x){
  int s = 0;
  for(int k : fc[x]){
    if(k >= lm) break;
    ll vl = pw[k] / __gcd(pw[k], (ll)x);
    if(vl > n) continue; s += mu[k] * t[vl];
  }
  return s * g[x];
}
void ins(int x, int F, vector<int> &v){
  v.push_back(x);
  for(int to : tr[x]) if(to ^ F) ins(to, x, v);
}
void sol(int x, int F, bool kp){
  for(int to : tr[x]){
    if((to ^ F) && (to ^ sn[x])){ sol(to, x, 0); r[x] += r[to]; }
  }
  if(sn[x]){ sol(sn[x], x, 1); r[x] += r[sn[x]]; }
  for(int k : fc[a[x]]) t[k] += g[a[x]]; r[x] += upd(a[x]);
  for(int to : tr[x]){
    if((to ^ F) && (to ^ sn[x])){
      vector<int> vc; ins(to, x, vc);
      for(int k : vc) r[x] += upd(a[k]);
      for(int x : vc) for(int k : fc[a[x]]) t[k] += g[a[x]];
    }
  }
  if(!kp){
    vector<int> vc; ins(x, F, vc);
    for(int x : vc) for(int k : fc[a[x]]) t[k] = 0;
  }
}
int main(){
  // file();
  ios::sync_with_stdio(0); cin.tie(0);
  cin >> n >> d;
  for(int i = 1, u, v; i < n; i++){
    cin >> u >> v;
    tr[u].push_back(v);
    tr[v].push_back(u);
  }
  for(int i = 1; i <= n; i++) cin >> a[i];
  init(); dfs(1, 0); sol(1, 0, 0);
  for(int i = 1; i <= n; i++) cout << r[i] << "\n";
  cerr << (double) clock() / CLOCKS_PER_SEC * 1000 << " ms\n";
  return 0;
}