#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("yard.in", "r", stdin);
  freopen("yard.out", "w", stdout);
}
using ll = long long;
const int nMax = 2e5 + 5, kMax = 20;
int n, pc, o, d;
array<vector<int>, nMax> g;
array<int, nMax> a, p, res, dfn;
array<array<int, nMax>, kMax> mn;
void getPr(){
  vector<bool> ispr(n + 1, 1);
  for(int i = 2; i <= n; i++){
    if(ispr[i]) p[++pc] = i;
    for(int j = 1; j <= pc; j++){
      int P = p[j];
      if(i * P > n) break;
      ispr[i * P] = 0;
      if(!(i % P)) break;
    }
  }
}
void dfs(int x, int F){
  mn[0][dfn[x] = ++o] = F;
  for(int to : g[x]) if(to ^ F) dfs(to, x);
}
int Min(int x, int y){ return dfn[x] < dfn[y] ? x : y; }
int lca(int x, int y){
  if(x == y) return x;
  if((x = dfn[x]) > (y = dfn[y])) swap(x, y);
  int p = 31 ^ __builtin_clz(y++ - x++);
  return Min(mn[p][x], mn[p][y - (1 << p)]);
}
void dfs2(int x, int F){
  for(int to : g[x]){
    if(to ^ F){ dfs2(to, x); res[x] += res[to]; }
  }
}
int main(){
  // file();
  ios::sync_with_stdio(0); cin.tie(0);
  cin >> n >> d; getPr();
  for(int i = 1, u, v; i < n; i++){
    cin >> u >> v;
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }
  dfs(1, 0);
  for(int i = 1; i < kMax; i++){
    for(int l = 1, r = (1 << i); r <= n; l++, r++){
      mn[i][l] = Min(mn[i - 1][l], mn[i - 1][l + (1 << i - 1)]);
    }
  }
  for(int i = 1; i <= n; i++) cin >> a[i];
  for(int i = 1; i <= n; i++){
    for(int j = i; j <= n; j++){
      int w = 1; map<int, int> mp;
      auto fac = [&](int x){
        for(int i = 1; i <= pc; i++){
          int P = p[i];
          if(P * P > x) break;
          for(; !(x % P); x /= P, mp[P]++, w = -w);
        }
        if(x ^ 1){ mp[x]++; w = -w; }
      };
      fac(a[i]); fac(a[j]);
      for(auto [x, y] : mp) if(y > d){ w = 0; break; }
      res[lca(i, j)] += w;
    }
  }
  dfs2(1, 0);
  for(int i = 1; i <= n; i++) cout << res[i] << "\n";
  return 0;
}