#include <bits/stdc++.h>
using namespace std;
bool ispr[1010];
vector<int> pr;
void sieve() {
  memset(ispr, 1, sizeof ispr);
  ispr[0] = ispr[1] = 0;
  for (int i = 2; i < 1010; i++) {
    if (ispr[i]) {
      pr.push_back(i);
      for (int j = 2 * i; j < 1010; j += i) ispr[j] = 0;
    }
  }
}
vector<vector<int> > g;
int in[100010], out[100010], tmp;
void go(int i, int par = -1) {
  in[i] = ++tmp;
  for (int j = 0; j < g[i].size(); j++) {
    if (g[i][j] != par) go(g[i][j], i);
  }
  out[i] = tmp;
}
int n, m;
int lazy[1 << 20];
bitset<1000> tr[1 << 20], emp, full;
void modify(int i, int v) {
  v %= m;
  tr[i] = ((tr[i] << v) & full) | (tr[i] >> (m - v));
}
void update(int i, int l, int r, int a, int b, int v) {
  if (lazy[i]) {
    modify(i, lazy[i]);
    if (l != r) {
      lazy[i * 2] = (lazy[i * 2] + lazy[i]) % m;
      lazy[i * 2 + 1] = (lazy[i * 2 + 1] + lazy[i]) % m;
    }
    lazy[i] = 0;
  }
  if (l > b || r < a) return;
  if (l >= a && r <= b) {
    modify(i, v);
    if (l != r) {
      lazy[i * 2] = (lazy[i * 2] + v) % m;
      lazy[i * 2 + 1] = (lazy[i * 2 + 1] + v) % m;
    }
    return;
  }
  update(i * 2, l, (l + r) / 2, a, b, v);
  update(i * 2 + 1, (l + r) / 2 + 1, r, a, b, v);
  tr[i] = tr[i * 2] | tr[i * 2 + 1];
}
void build(vector<int> &a) {
  memset(lazy, 0, sizeof lazy);
  for (int i = 0; i < (1 << 20); i++) tr[i].set(0);
  for (int i = 0; i < n; i++) update(1, 0, (1 << 18), in[i], in[i], a[i]);
}
bitset<1000> get(int i, int l, int r, int a, int b) {
  if (lazy[i]) {
    modify(i, lazy[i]);
    if (l != r) {
      lazy[i * 2] = (lazy[i * 2] + lazy[i]) % m;
      lazy[i * 2 + 1] = (lazy[i * 2 + 1] + lazy[i]) % m;
    }
    lazy[i] = 0;
  }
  if (l > b || r < a) return emp;
  if (l >= a && r <= b) return tr[i];
  return get(i * 2, l, (l + r) / 2, a, b) |
         get(i * 2 + 1, (l + r) / 2 + 1, r, a, b);
}
int main() {
  sieve();
  scanf("%d %d", &n, &m);
  ;
  emp.reset();
  for (int i = 0; i < m; i++) full.set(i);
  bitset<1000> prm;
  for (int i = 0; i < pr.size() && pr[i] < m; i++) prm.set(pr[i]);
  vector<int> a(n);
  for (int i = 0; i < n; scanf("%d", &a[i++]))
    ;
  g.clear();
  g.resize(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    ;
    g[u - 1].push_back(v - 1);
    g[v - 1].push_back(u - 1);
  }
  tmp = -1;
  go(0);
  build(a);
  int q;
  scanf("%d", &q);
  ;
  while (q--) {
    int t;
    scanf("%d", &t);
    ;
    if (t == 1) {
      int v, x;
      scanf("%d %d", &v, &x);
      ;
      update(1, 0, (1 << 18), in[v - 1], out[v - 1], x);
    } else {
      int v;
      scanf("%d", &v);
      ;
      bitset<1000> ret = get(1, 0, (1 << 18), in[v - 1], out[v - 1]) & prm;
      printf("%d\n", ret.count());
    }
  }
  return 0;
}
