#include<bits/stdc++.h>

 using namespace std;

 #define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);

 #define LL long long

 #define ULL unsigned LL

 #define fi first

 #define se second

 #define pb push_back

 #define lson l,m,rt<<1

 #define rson m+1,r,rt<<1|1

 #define max3(a,b,c) max(a,max(b,c))

 #define min3(a,b,c) min(a,min(b,c))

 #define _S(X) cout << x << ' ';

 #define __S(x) cout << x << endl;

 typedef pair<int,int> pll;

 const int INF = 0x3f3f3f3f;

 const LL mod =  (int)1e9+;

 const int N = 2e5 + ;

 int in[N], out[N], col[N], cc[N], cnt[N], num[N], ans[N];

 vector<int> son[N];

 int tot, n, m, blo;

 struct Node{

     int l, r, id, k;

 }q[N];

 bool cmp(Node x1, Node x2){

     if(x1.l/blo != x2.l/blo) return x1.l/blo < x2.l/blo;

     return x1.r < x2.r;

 }

 void Add(int c){

     num[++cnt[c]]++;

 }

 void Remove(int c){

     num[cnt[c]--]--;

 }

 void dfs(int o, int u){

     in[u] = ++tot;

     cc[tot] = col[u];

     for(int i = ; i < son[u].size(); i++){

         if(son[u][i] == o) continue;

         dfs(u, son[u][i]);

     }

     out[u] = tot;

 }

 int main(){

     scanf("%d%d", &n, &m);

     for(int i = ; i <= n; i++)

         scanf("%d", &col[i]);

     blo = sqrt(n);

     int u, v;

     for(int i = ; i < n; i++){

         scanf("%d%d", &u, &v);

         son[u].pb(v);

         son[v].pb(u);

     }

     dfs(-,);

     for(int i = ; i <= m; i++){

         q[i].id = i;

         scanf("%d%d", &u, &v);

         q[i].k = v;

         q[i].l = in[u];

         q[i].r = out[u];

     }

     sort(q+, q++m, cmp);

    // cout << "vujgfuy" << endl;

     int l = , r = ;

     for(int i = ; i <= m; i++)

     {

         while(r < q[i].r) Add(cc[++r]);

         while(r > q[i].r) Remove(cc[r--]);

         while(l < q[i].l) Remove(cc[l++]);

         while(l > q[i].l) Add(cc[--l]);

         ans[q[i].id] = num[q[i].k];

     }

     for(int i = ; i <= m; i++)

         printf("%d\n", ans[i]);

     return ;

 }