Problem: You have a rooted tree consisting of n vertices. Each vertex of the tree has some color. We will assume that the tree vertices are numbered by integers from 1 to n. Then we represent the color of vertex v as cv. The tree root is a vertex with number 1.

In this problem you need to answer to m queries. Each query is described by two integers vj, kj. The answer to query vj, kj is the number of such colors of vertices x, that the subtree of vertex vj contains at least kj vertices of color x.

You can find the definition of a rooted tree by the following link: http://en.wikipedia.org/wiki/Tree_(graph_theory).

Input

The first line contains two integers n and m (2 ≤ n ≤ 105; 1 ≤ m ≤ 105). The next line contains a sequence of integers c1, c2, ..., cn (1 ≤ ci ≤ 105). The next n - 1 lines contain the edges of the tree. The i-th line contains the numbers ai, bi (1 ≤ ai, bi ≤ n; ai ≠ bi) — the vertices connected by an edge of the tree.

Next m lines contain the queries. The j-th line contains two integers vj, kj (1 ≤ vj ≤ n; 1 ≤ kj ≤ 105).

Output

Print m integers — the answers to the queries in the order the queries appear in the input.

Examples

Input

8 5
1 2 2 3 3 2 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 2
1 3
1 4
2 3
5 3


Output

2
2
1
0
1


Input

4 1
1 2 3 4
1 2
2 3
3 4
1 1


Output

4

Note

A subtree of vertex v in a rooted tree with root r is a set of vertices {u : dist(r, v) + dist(v, u) = dist(r, u)}. Where dist(x, y) is the length (in edges) of the shortest path between vertices x and y.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline void rd(int &x) {
  x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
}
const int N = 1e5 + 5;
int n, q, cnt[N], c[N], ans[N], mx;
int fa[N], son[N], sz[N];
struct Graph {
  int head[N], to[N << 1], nxt[N << 1], cnt;
  inline void add(int u, int v) {
    to[++cnt] = v;
    nxt[cnt] = head[u];
    head[u] = cnt;
  }
} G, Q;
struct Bit {
  int b[N];
  inline void add(int p, int val) {
    if (!p) return;
    while (p <= mx) {
      b[p] += val;
      p += p & -p;
    }
  }
  inline int query(int p) {
    int res = 0;
    while (p) {
      res += b[p];
      p -= p & -p;
    }
    return res;
  }
  inline int ask(int p) { return query(mx) - query(p - 1); }
} bit;
void pre(int u) {
  sz[u] = 1;
  for (int i = G.head[u], v = G.to[i]; i; i = G.nxt[i], v = G.to[i]) {
    if (v == fa[u]) continue;
    fa[v] = u, pre(v);
    sz[u] += sz[v];
    if (sz[son[u]] < sz[v]) son[u] = v;
  }
}
void cal(int u, int val, int son) {
  bit.add(cnt[c[u]], -1);
  cnt[c[u]] += val;
  bit.add(cnt[c[u]], 1);
  for (int i = G.head[u], v = G.to[i]; i; i = G.nxt[i], v = G.to[i])
    if (v != fa[u] && v != son) cal(v, val, son);
}
void dfs(int u) {
  for (int i = G.head[u], v = G.to[i]; i; i = G.nxt[i], v = G.to[i])
    if (v != fa[u] && v != son[u]) dfs(v);
  if (son[u]) dfs(son[u]);
  cal(u, 1, son[u]);
  for (int i = Q.head[u], v = Q.to[i]; i; i = Q.nxt[i], v = Q.to[i])
    if (v <= mx) ans[i] = bit.ask(v);
  if (son[fa[u]] != u) cal(u, -1, 0);
}
int main() {
  rd(n), rd(q);
  for (int i = 1, I = (n) + 1; i < I; ++i)
    rd(c[i]), ++cnt[c[i]], mx = max(mx, cnt[c[i]]);
  memset(cnt, 0, sizeof(cnt));
  int u, v;
  for (int i = 1, I = (n - 1) + 1; i < I; ++i)
    rd(u), rd(v), G.add(u, v), G.add(v, u);
  for (int i = 1, I = (q) + 1; i < I; ++i) rd(u), rd(v), Q.add(u, v);
  pre(1), dfs(1);
  for (int i = 1, I = (q) + 1; i < I; ++i) printf("%d\n", ans[i]);
  return 0;
}