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>).
n,m=map(int,input().split())
color=[int(i) for i in input().split()]
son=[[] for i in range(n+1)]
n_col=len(set(color))
val=[[0 for j in range(n_col)] for i in range(n+1)]
gen=[[0],[1]]
for o in range(n-1):
    a,b=map(int,input().split())
    son[a]+=[b]
    son[b]+=[a]
x=[1]
y=[]
t=[]
fa={}
leaf=[]
while True:
    for i in x:
        #print(i)
        u=son[i]
        if i!=1:
            u.remove(fa[i])
            son[i]=u
        if len(u)==0:
            leaf+=[i]
        else:
            for j in u:
                fa[j]=i
        y+=u
    if y==[]:
        break
    else:
        gen+=[y]
        x=y
        y=[]
#print(son)
#print(fa)
#print(leaf)
#print(gen)
for i in leaf:
    val[i][color[i-1]-1]+=1
for i in range(len(gen)-2,0,-1):
    for j in gen[i]:
        for k in son[j]:
            for p in range(n_col):
                val[j][p]+=val[k][p]
        val[j][color[j-1]-1]+=1
'''for i in val:
    print(i)'''
ans=[]
for i in range(m):
    a,b=map(int,input().split())
    num=0
    for j in val[a]:
        if j>=b:
            num+=1
    ans+=[str(num)]
print('\n'.join(ans))
