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 p99
{
	static final int SIZE = 316;
	static int n, color[], a[], start[], end[], t, cnts[], gt[];
	static ArrayList<Integer> adj[];
	public static void main(String[] args)
	{
		FastScanner in = new FastScanner();
		n = in.nextInt();
		int q = in.nextInt();
		adj = new ArrayList[n];
		color = new int[n];
		a = new int[n];
		start = new int[n];
		end = new int[n];
		Query qs[] = new Query[q];
		
		for(int i = 0; i < n; i++)
		{
			adj[i] = new ArrayList<>();
			color[i] = in.nextInt();
		}
		
		for(int i = 0; i < n-1; i++)
		{
			int a = in.nextInt()-1;
			int b = in.nextInt()-1;
			
			adj[a].add(b);
			adj[b].add(a);
		}
		
		t = 0;
		dfs(0, -1);
		for(int i = 0; i < q; i++)
		{
			int a = in.nextInt()-1;
			int k = in.nextInt();
			qs[i] = new Query(start[a], end[a], k, i);
		}
		
		Arrays.sort(qs);
		int ans[] = new int[q];
		cnts = new int[100000+1];
		gt = new int[100000+1];
		int l = 0, r = 0;
		for(int i = 0; i < q; i++)
		{
			int L = qs[i].l, R = qs[i].r;
			while(l > L)
				add(--l);
			while(r <= R)
				add(r++);
			while(l < L)
				remove(l++);
			while(r > R+1)
				remove(--r);
			
			ans[qs[i].id] = gt[qs[i].k-1];
		}
		
		PrintWriter out = new PrintWriter(System.out);
		for(int i = 0; i < q; i++)
			out.println(ans[i]);
		out.close();
	}

	private static void remove(int i)
	{
		i = a[i];
		cnts[i]--;
		gt[cnts[i]]--;
	}

	private static void add(int i)
	{
		i = a[i];
		gt[cnts[i]]++;
		cnts[i]++;
	}

	private static void dfs(int u, int p)
	{
		start[u] = t++;
		a[start[u]] = color[u];
		
		for(int v : adj[u])
			if(v != p)
				dfs(v, u);
		
		end[u] = t-1;
	}
	
	public static class Query implements Comparable<Query>
	{
		int l, r, k, id;
		
		public Query(int ll, int rr, int kk, int i)
		{
			l = ll;
			r = rr;
			k = kk;
			id = i;
		}

		@Override
		public int compareTo(Query o)
		{
			int a = l/SIZE;
			int b = o.l/SIZE;
			
			if(a != b)
				return a-b;
			if((a & 1) == 0)
				return r - o.r;
			return o.r - r;
		}
		
		public String toString()
		{
			return l + " " + r;
		}
	}

	public static class FastScanner
	{
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(String s)
		{
			try {
				br = new BufferedReader(new FileReader(s));
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}

		public FastScanner()
		{
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String nextToken()
		{
			while (st == null || !st.hasMoreElements())
			{
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt()
		{
			return Integer.parseInt(nextToken());
		}

		long nextLong()
		{
			return Long.parseLong(nextToken());
		}

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