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 JAVA):

Solution:
import java.io.*;
import java.util.*;

public class treesAndQueries {
	static int[] c,colors;
	static int ct=0;
	static ArrayList<Integer>[] a;
	static int[] f,atleast;
	static int b;
	static int[] pre,post;
	
	public static void main(String[] args) {
		FastScanner scan=new FastScanner();
		PrintWriter out=new PrintWriter(System.out);
		int n=scan.nextInt(), q=scan.nextInt();
		b=(int)Math.sqrt(n);
		c=new int[n];
		a=new ArrayList[n];
		for(int i=0;i<n;i++) {
			a[i]=new ArrayList<>();
			c[i]=scan.nextInt();
		}
		for(int i=0;i<n-1;i++) {
			int u=scan.nextInt()-1, v=scan.nextInt()-1;
			a[u].add(v);
			a[v].add(u);
		}
		pre=new int[n];
		post=new int[n];

		colors=new int[n];
		init(0,-1);

		query[] queries=new query[q];
		for(int i=0;i<q;i++) {
			int x=scan.nextInt()-1;
			queries[i]=new query(pre[x],post[x],scan.nextInt(),i);
		}

		Arrays.sort(queries);

		int[] res=new int[q];
		f=new int[100001];
		atleast=new int[100001];

		int l=0, r=-1;
		for(int i=0;i<q;i++) {
			query cur=queries[i];
			int cl=cur.l, cr=cur.r;
			while(l>cl) {
				add(colors[--l]);
			}
			while(r<cr) {
				add(colors[++r]);
			}
			while(l<cl) {
				remove(colors[l++]);
			}
			while(r>cr) {
				remove(colors[r--]);
			}
			res[cur.id]=atleast[cur.k];
		}
		for(int i:res) out.println(i);
		out.close();
	}
	public static void add(int x) {
		f[x]++;
		atleast[f[x]]++;
	}
	public static void remove(int x) {
		atleast[f[x]]--;
		f[x]--;
	}
	
	static class query implements Comparable<query> {
		int l,r;
		int block;
		int k,id;

		query(int l, int r, int k, int id) {
			this.l=l;
			this.r=r;
			this.k=k;
			this.id=id;
			this.block=l/b;
		}
		@Override
		public int compareTo(query o) {
			if(block==o.block) return r-o.r;
			return block-o.block;
		}
	}
	
	public static void init(int at, int prev) {
		pre[at]=ct++;
		colors[pre[at]]=c[at];
		for(int nxt:a[at]) {
			if(nxt!=prev) init(nxt,at);
		}
		post[at]=ct-1;
	}
	
	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner() {
			try	{
				br = new BufferedReader(new InputStreamReader(System.in));
				st = new StringTokenizer(br.readLine());
			} catch (Exception e){e.printStackTrace();}
		}

		public String next() {
			if (st.hasMoreTokens())	return st.nextToken();
			try {st = new StringTokenizer(br.readLine());}
			catch (Exception e) {e.printStackTrace();}
			return st.nextToken();
		}

		public int nextInt() {return Integer.parseInt(next());}

		public long nextLong() {return Long.parseLong(next());}

		public double nextDouble() {return Double.parseDouble(next());}

		public String nextLine() {
			String line = "";
			if(st.hasMoreTokens()) line = st.nextToken();
			else try {return br.readLine();}catch(IOException e){e.printStackTrace();}
			while(st.hasMoreTokens()) line += " "+st.nextToken();
			return line;
		}
	}
}
/*
7 1
1 2 3 4 5 5 5
1 2
1 3
1 4
3 5
4 6
4 7
4 1

2
 */