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 *c*<sub class="lower-index">*v*</sub>. 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 *v*<sub class="lower-index">*j*</sub>, *k*<sub class="lower-index">*j*</sub>. The answer to query *v*<sub class="lower-index">*j*</sub>, *k*<sub class="lower-index">*j*</sub> is the number of such colors of vertices *x*, that the subtree of vertex *v*<sub class="lower-index">*j*</sub> contains at least *k*<sub class="lower-index">*j*</sub> 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).
The first line contains two integers *n* and *m* (2 ≤ *n* ≤ 10<sup class="upper-index">5</sup>; 1 ≤ *m* ≤ 10<sup class="upper-index">5</sup>). The next line contains a sequence of integers *c*<sub class="lower-index">1</sub>, *c*<sub class="lower-index">2</sub>, ..., *c*<sub class="lower-index">*n*</sub> (1 ≤ *c*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>). The next *n* - 1 lines contain the edges of the tree. The *i*-th line contains the numbers *a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> ≤ *n*; *a*<sub class="lower-index">*i*</sub> ≠ *b*<sub class="lower-index">*i*</sub>) — the vertices connected by an edge of the tree.

Next *m* lines contain the queries. The *j*-th line contains two integers *v*<sub class="lower-index">*j*</sub>, *k*<sub class="lower-index">*j*</sub> (1 ≤ *v*<sub class="lower-index">*j*</sub> ≤ *n*; 1 ≤ *k*<sub class="lower-index">*j*</sub> ≤ 10<sup class="upper-index">5</sup>).
from collections import defaultdict

nm = map(int, input().split())
n = nm[0]
m = nm[1]
c = map(int, input().split())

cmap = {}
cn = 0
for ci in c:
    if ci in cmap: continue
    else:
        cmap[ci] = cn
        cn += 1

for i in range(n):
    c[i] = cmap[c[i]]



edges = defaultdict(lambda: [])

for a in range(n - 1):
    ij = map(int, input().split())
    i = ij[0]
    j = ij[1]
    edges[i - 1].append(j - 1)
    edges[j - 1].append(i - 1)

ept_cx = [0] * cn
cx = []
for a in range(n):
    cx.append(ept_cx[:])

went = [False] * n

def find_trees(i):
    went[i] = True
    for j in edges[i]:
        if went[j]: continue
        find_trees(j)
        for k in range(cn):
            cx[i][k] += cx[j][k]
    cx[i][c[i]] += 1
    went[i] = False

find_trees(0)

rst = []
for a in range(m):
    vk = map(int, input().split)
    v = vk[0]
    k = vk[1]
    v -= 1
    rst.append(str(sum([1 for x in cx[v] if x >= k])))

print('\n'.join(rst))