#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 5;
const int maxm = 1000 + 5;
int a[maxn], n, m;
bitset<maxm> prime, ans, bs;
int dfn[maxn][2], rd[maxn], head[maxn], tot, clk;
struct edge {
  int to, next;
  edge(int to = 0, int next = 0) : to(to), next(next) {}
} G[maxn << 1];
bool vis[maxm];
struct segtree {
  bitset<maxm> node[maxn << 2];
  int lazy[maxn << 2];
  void modify(int rt, int c) {
    lazy[rt] += c;
    if (lazy[rt] >= m) lazy[rt] -= m;
    node[rt] = ((node[rt] << c) | (node[rt] >> (m - c))) & bs;
  }
  void pushup(int rt) { node[rt] = node[rt << 1] | node[rt << 1 | 1]; }
  void pushdown(int rt) {
    if (lazy[rt]) {
      modify(rt << 1, lazy[rt]);
      modify(rt << 1 | 1, lazy[rt]);
      lazy[rt] = 0;
    }
  }
  void build(int rt, int l, int r) {
    lazy[rt] = 0;
    if (l == r) {
      node[rt].reset();
      node[rt][rd[l]] = 1;
      return;
    }
    int mid = (l + r) >> 1;
    build(rt << 1, l, mid);
    build(rt << 1 | 1, mid + 1, r);
    pushup(rt);
  }
  void update(int rt, int l, int r, int x, int y, int c) {
    if (x <= l && r <= y) {
      modify(rt, c);
      return;
    }
    pushdown(rt);
    int mid = (l + r) >> 1;
    if (x <= mid) update(rt << 1, l, mid, x, y, c);
    if (mid < y) update(rt << 1 | 1, mid + 1, r, x, y, c);
    pushup(rt);
  }
  void query(int rt, int l, int r, int x, int y) {
    if (x <= l && r <= y) {
      ans |= node[rt];
      return;
    }
    pushdown(rt);
    int mid = (l + r) >> 1;
    if (x <= mid) query(rt << 1, l, mid, x, y);
    if (mid < y) query(rt << 1 | 1, mid + 1, r, x, y);
  }
} tree;
void init() {
  memset(head, -1, sizeof(head));
  tot = clk = 0;
}
void addedge(int u, int v) {
  G[tot] = edge(v, head[u]);
  head[u] = tot++;
  G[tot] = edge(u, head[v]);
  head[v] = tot++;
}
void sieve() {
  for (int i = 2; i < maxm; ++i) {
    if (!vis[i]) {
      prime[i] = 1;
      for (int j = i << 1; j < maxm; j += i) vis[j] = true;
    }
  }
}
void dfs(int u, int fa) {
  dfn[u][0] = ++clk;
  rd[clk] = a[u];
  for (int i = head[u]; ~i; i = G[i].next) {
    int v = G[i].to;
    if (v == fa) continue;
    dfs(v, u);
  }
  dfn[u][1] = clk;
}
int main() {
  sieve();
  while (~scanf("%d%d", &n, &m)) {
    init();
    bs.reset();
    for (int i = 0; i < m; ++i) bs[i] = 1;
    for (int i = 1; i <= n; ++i) {
      scanf("%d", &a[i]);
      a[i] %= m;
    }
    for (int i = 1; i < n; ++i) {
      int u, v;
      scanf("%d%d", &u, &v);
      addedge(u, v);
    }
    dfs(1, 0);
    tree.build(1, 1, n);
    int q;
    scanf("%d", &q);
    while (q--) {
      int op, x, y;
      scanf("%d%d", &op, &x);
      if (op == 1) {
        scanf("%d", &y);
        tree.update(1, 1, n, dfn[x][0], dfn[x][1], y % m);
      } else {
        ans.reset();
        tree.query(1, 1, n, dfn[x][0], dfn[x][1]);
        printf("%d\n", (ans & prime).count());
      }
    }
  }
  return 0;
}
