#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, D;
vector<int> A, B;
vector<int> C;

vector<int> lpf;
vector<vector<pair<int, int>>> pess;
vector<int> fs;

vector<vector<int>> diviss;

vector<vector<int>> graph;
vector<Int> ans;

pair<vector<int>, map<int, int>> dfs(int u, int pa) {
  pair<vector<int>, map<int, int>> ret;
  {
    const int c = C[u];
    ret.first.push_back(c);
    if (fs[c]) {
      for (const int divi : diviss[c]) {
        ret.second[divi] += fs[c];
      }
    }
    // f(c^2)
    bool ok = true;
    for (const auto &pe : pess[c]) {
      ok = ok && (2 * pe.second <= D);
    }
    if (ok) {
      ans[u] += 1;
    }
  }
  for (const int v : graph[u]) if (pa != v) {
    auto res = dfs(v, u);
    ans[u] += ans[v];
    if (ret.first.size() < res.first.size()) {
      swap(ret, res);
    }
    for (const int c : res.first) {
      const auto &pes = pess[c];
      const int len = pes.size();
      vector<Int> prods(1 << len);
      prods[0] = 1;
      for (int i = 0; i < len; ++i) {
        const int p = pes[i].first;
        const int e = pes[i].second;
        Int q = 1;
        for (int f = 0; f < D + 1 - e; ++f) {
          q *= p;
          if (chmin<Int>(q, N + 1)) break;
        }
        for (int h = 0; h < 1 << i; ++h) {
          prods[h | 1 << i] = min<Int>(prods[h] * q, N + 1);
        }
      }
      int sum = 0;
      for (int h = 0; h < 1 << len; ++h) if (prods[h] <= N) {
        auto it = ret.second.find(prods[h]);
        if (it != ret.second.end()) {
          sum += (__builtin_parity(h)?-1:+1) * it->second;
        }
      }
      ans[u] += sum * fs[c];
    }
    for (const int c : res.first) {
      ret.first.push_back(c);
      for (const int divi : diviss[c]) {
        ret.second[divi] += fs[c];
      }
    }
  }
  return ret;
}

int main() {
  for (; ~scanf("%d%d", &N, &D); ) {
    A.resize(N - 1);
    B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    C.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &C[u]);
    }
    
    lpf.assign(N + 1, 0);
    for (int n = 2; n <= N; ++n) lpf[n] = n;
    for (int p = 2; p <= N; ++p) if (lpf[p] == p) {
      for (int n = 2 * p; n <= N; n += p) chmin(lpf[n], p);
    }
    pess.assign(N + 1, {});
    fs.assign(N + 1, 0);
    for (int n = 1; n <= N; ++n) {
      fs[n] = 1;
      for (int nn = n; nn > 1; ) {
        const int p = lpf[nn];
        int e = 0;
        do {
          ++e;
          nn /= p;
        } while (nn % p == 0);
        pess[n].emplace_back(p, e);
        fs[n] *= ((e <= D) ? ((e&1)?-1:+1) : 0);
      }
    }
// cerr<<"fs = "<<fs<<endl;
    
    diviss.assign(N + 1, {});
    for (int d = 1; d <= N; ++d) {
      for (int n = d; n <= N; n += d) {
        diviss[n].push_back(d);
      }
    }
    
    graph.assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      graph[A[i]].push_back(B[i]);
      graph[B[i]].push_back(A[i]);
    }
    ans.assign(N, 0);
    dfs(0, -1);
    for (int u = 0; u < N; ++u) {
      printf("%lld\n", ans[u]);
    }
cerr<<"========"<<endl;
  }
  return 0;
}