#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
bitset<1000> tr[N << 2], STD;
int tag[N << 2], a[N], m;
vector<int> e[N];
int dfn[N], sz[N], id[N], tot;
bool check(int x) {
  for (int i = 2; i * i <= x; ++i)
    if (x % i == 0) return 0;
  return 1;
}
void dfs(int u, int fath) {
  dfn[u] = ++tot, id[tot] = u, sz[u] = 1;
  for (int v : e[u])
    if (v != fath) dfs(v, u), sz[u] += sz[v];
}
void build(int p, int l, int r) {
  if (l == r) {
    tr[p][a[id[l]]] = 1;
    return;
  }
  int mid = (l + r) >> 1;
  build(p << 1, l, mid), build(p << 1 | 1, mid + 1, r);
  tr[p] = tr[p << 1] | tr[p << 1 | 1];
}
void add(int p, int v) {
  tag[p] = (tag[p] + v) % m;
  tr[p] = (tr[p] << v) | (tr[p] >> (m - v));
}
void pushdown(int p) {
  if (tag[p]) add(p << 1, tag[p]), add(p << 1 | 1, tag[p]), tag[p] = 0;
}
void upt(int p, int l, int r, int ql, int qr, int v) {
  if (ql <= l && r <= qr) return add(p, v);
  pushdown(p);
  int mid = (l + r) >> 1;
  if (ql <= mid) upt(p << 1, l, mid, ql, qr, v);
  if (mid < qr) upt(p << 1 | 1, mid + 1, r, ql, qr, v);
  tr[p] = tr[p << 1] | tr[p << 1 | 1];
}
bitset<1000> query(int p, int l, int r, int ql, int qr) {
  if (ql <= l && r <= qr) return tr[p];
  pushdown(p);
  int mid = (l + r) >> 1;
  bitset<1000> res;
  if (ql <= mid) res |= query(p << 1, l, mid, ql, qr);
  if (mid < qr) res |= query(p << 1 | 1, mid + 1, r, ql, qr);
  return res;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n, q;
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) cin >> a[i], a[i] %= m;
  for (int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v;
    e[u].push_back(v), e[v].push_back(u);
  }
  dfs(1, 0);
  build(1, 1, n);
  for (int i = 2; i < m; ++i)
    if (check(i)) STD[i] = 1;
  cin >> q;
  while (q--) {
    int opt, v, x;
    cin >> opt >> v;
    if (opt == 1)
      cin >> x, x %= m, upt(1, 1, n, dfn[v], dfn[v] + sz[v] - 1, x);
    else {
      bitset<1000> res = query(1, 1, n, dfn[v], dfn[v] + sz[v] - 1);
      cout << (res & STD).count() << "\n";
    }
  }
}
