Problem: Yash loves playing with trees and gets especially excited when they have something to do with prime numbers. On his 20th birthday he was granted with a rooted tree of n nodes to answer queries on. Hearing of prime numbers on trees, Yash gets too intoxicated with excitement and asks you to help out and answer queries on trees for him. Tree is rooted at node 1. Each node i has some value ai associated with it. Also, integer m is given.

There are queries of two types:

  1. for given node v and integer value x, increase all ai in the subtree of node v by value x
  2. for given node v, find the number of prime numbers p less than m, for which there exists a node u in the subtree of v and a non-negative integer value k, such that au = p + m·k.

Input

The first of the input contains two integers n and m (1 ≤ n ≤ 100 000, 1 ≤ m ≤ 1000) — the number of nodes in the tree and value m from the problem statement, respectively.

The second line consists of n integers ai (0 ≤ ai ≤ 109) — initial values of the nodes.

Then follow n - 1 lines that describe the tree. Each of them contains two integers ui and vi (1 ≤ ui, vi ≤ n) — indices of nodes connected by the i-th edge.

Next line contains a single integer q (1 ≤ q ≤ 100 000) — the number of queries to proceed.

Each of the last q lines is either 1 v x or 2 v (1 ≤ v ≤ n, 0 ≤ x ≤ 109), giving the query of the first or the second type, respectively. It's guaranteed that there will be at least one query of the second type.

Output

For each of the queries of the second type print the number of suitable prime numbers.

Examples

Input

8 20
3 7 9 8 4 11 7 3
1 2
1 3
3 4
4 5
4 6
4 7
5 8
4
2 1
1 1 1
2 5
2 4


Output

3
1
1


Input

5 10
8 7 5 1 0
1 2
2 3
1 5
2 4
3
1 1 0
1 1 2
2 2


Output

2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int maxm = 1005;
bool isp[maxm];
int n, m;
bitset<maxm> p;
int a[maxn], L[maxn], R[maxn], rp[maxn], cnt;
struct Edge {
  int v, next;
} E[maxn << 1];
int head[maxn], tol;
void Init() {
  memset(head, -1, sizeof head);
  tol = cnt = 0;
  memset(isp, true, sizeof isp);
  isp[0] = isp[1] = false;
  for (int i = 2; i < m; i++) {
    if (!isp[i]) continue;
    p[i] = 1;
    for (int j = i + i; j < m; j += i) {
      isp[j] = false;
    }
  }
}
void add_edge(int u, int v) {
  E[tol].v = v;
  E[tol].next = head[u];
  head[u] = tol++;
}
struct SegTree {
  int l, r, add;
  bitset<maxm> have;
  int mid() { return (l + r) >> 1; }
  void Add(int ad) {
    ad %= m;
    add = (add + ad) % m;
    have = (have << ad) | (have >> (m - ad));
  }
} tree[maxn << 2];
void push_down(int rt) {
  if (tree[rt].add) {
    tree[rt << 1].Add(tree[rt].add);
    tree[rt << 1 | 1].Add(tree[rt].add);
    tree[rt].add = 0;
  }
}
void push_up(int rt) {
  tree[rt].have = tree[rt << 1].have | tree[rt << 1 | 1].have;
}
void build(int l, int r, int rt) {
  tree[rt].l = l;
  tree[rt].r = r;
  tree[rt].add = 0;
  tree[rt].have = 0;
  if (l == r) {
    tree[rt].have[a[rp[l]] % m] = 1;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, rt << 1);
  build(mid + 1, r, rt << 1 | 1);
  push_up(rt);
}
void Add(int l, int r, int rt, int add) {
  if (l <= tree[rt].l && tree[rt].r <= r) {
    tree[rt].Add(add);
    return;
  }
  push_down(rt);
  int mid = tree[rt].mid();
  if (l <= mid) Add(l, r, rt << 1, add);
  if (mid < r) Add(l, r, rt << 1 | 1, add);
  push_up(rt);
}
bitset<maxm> ans;
void query(int l, int r, int rt) {
  if (l <= tree[rt].l && tree[rt].r <= r) {
    ans |= tree[rt].have;
    return;
  }
  push_down(rt);
  int mid = tree[rt].mid();
  if (l <= mid) query(l, r, rt << 1);
  if (mid < r) query(l, r, rt << 1 | 1);
}
void dfs(int u, int pre) {
  L[u] = ++cnt;
  rp[cnt] = u;
  for (int i = head[u]; ~i; i = E[i].next) {
    int v = E[i].v;
    if (v == pre) continue;
    dfs(v, u);
  }
  R[u] = cnt;
}
int main() {
  int q, u, v, ope, x;
  scanf("%d%d", &n, &m);
  Init();
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &u, &v);
    add_edge(u, v);
    add_edge(v, u);
  }
  dfs(1, -1);
  build(1, n, 1);
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &ope);
    if (ope == 1) {
      scanf("%d%d", &v, &x);
      Add(L[v], R[v], 1, x);
    } else {
      scanf("%d", &v);
      ans = 0;
      query(L[v], R[v], 1);
      printf("%d\n", (ans & p).count());
    }
  }
  return 0;
}