1
#include <bits/stdc++.h>
2
using namespace std;
3

4
//#undef LOCAL_DEBUG
5
#ifdef LOCAL_DEBUG
6
#include "debug.h"
7
#else
8
#define debug(...) (void)0
9
#define debug_array(arr, len) (void)0
10
#define debug_container(container) (void)0
11
#endif
12

13
typedef unsigned long long ull;
14
typedef long long ll;
15
typedef pair<int,int> P;
16
const int maxn=1e5;
17

18
int n;
19
vector<int> G[maxn+5];
20
int color[maxn+5];
21

22
int big[maxn+5];
23
int size[maxn+5];
24
void rebuild(int u,int fa){
25
    size[u]=1;
26
    for (int v: G[u])
27
        if (v!=fa){
28
            rebuild(v,u);
29
            size[u]+=size[v];
30
            if (size[big[u]]<size[v])
31
                big[u]=v;
32
        }
33
}
34

35
int cnt[maxn+5];
36
int color_size;
37
void add(int u,int x){
38
    cnt[color[u]]+=x;
39
    if (cnt[color[u]]==0)
40
        color_size--;
41
    else if (x==1&&cnt[color[u]]==1)
42
        color_size++;
43
}
44
void update(int u,int fa,int x){
45
    add(u,x);
46
    for (int v: G[u])
47
        if (v!=fa)
48
            update(v,u,x);
49
}
50

51
int ans[maxn+5];
52
void dsu_on_tree(int u,int fa,bool keep){
53
    for (int v: G[u])
54
        if (v!=fa&&v!=big[u])
55
            dsu_on_tree(v,u,false);
56
    if (big[u])
57
        dsu_on_tree(big[u],u,true);
58
    add(u,1);
59
    for (int v: G[u])
60
        if (v!=fa&&v!=big[u])
61
            update(v,u,1);
62
    ans[u]=color_size;
63
    if (keep==false){
64
        add(u,-1);
65
        for (int v: G[u])
66
            if (v!=fa)
67
                update(v,u,-1);
68
    }
69
}
70

71
void solve(void){
72
  cin>>n;
73
    for (int i=1,u,v;i<n;i++){
74
        cin>>u>>v;
75
        G[u].push_back(v);
76
        G[v].push_back(u);
77
    }
78
    for (int i=1;i<=n;i++)
79
        cin>>color[i];
80
    rebuild(1,0);
81
  dsu_on_tree(1,0,true);
82
    int q,u;
83
    cin>>q;
84
    while (q--){
85
        cin>>u;
86
        cout<<ans[u]<<endl;
87
    }
88
}
89

90
int main(){
91
  std::ios::sync_with_stdio(false);
92
  std::cin.tie(nullptr);
93
  std::cout.tie(nullptr);
94
  int t=1;
95
//  cin>>t;
96
  while (t--)
97
    solve();
98
//    cout<<(solve()?"YES":"NO")<<endl;
99
  return 0;
100
}

1
#include <bits/stdc++.h>
2
using namespace std;
3

4
#undef LOCAL_DEBUG
5
#ifdef LOCAL_DEBUG
6
#include "debug.h"
7
#else
8
#define debug(...) (void)0
9
#define debug_array(arr, len) (void)0
10
#define debug_container(container) (void)0
11
#endif
12

13
typedef unsigned long long ull;
14
typedef long long ll;
15
typedef pair<int,int> P;
16
const int maxn=1e5;
17
const int inf=0x3fffffff;
18

19
int n,k;
20
int color[maxn+5];
21

22
vector<int> G[maxn+5],T[maxn+5];
23

24
int sz[maxn+5];
25
int son[maxn+5];
26
void rebuild(int u,int fa){
27
    sz[u]=1;
28
    for (int v: G[u])
29
        if (v!=fa){
30
            rebuild(v,u);
31
            sz[u]+=sz[v];
32
            if (sz[son[u]]<sz[v])
33
                son[u]=v;
34
        }
35
}
36

37
int line[maxn+5],len;
38
void connect(int u,int fa){
39
    line[++len]=u;
40
    debug(u,len);
41
    if (len-k-1>0&&son[line[len-k-1]]==line[len-k]){
42
        debug(line[len-k-1],u);
43
        T[line[len-k-1]].push_back(u);
44
    }
45
    for (int v: G[u])
46
        if (v!=fa)
47
            connect(v,u);
48
    len--;
49
}
50

51

52
int cnt[maxn+5];
53
int color_sz;
54

55
void revise(int u,int x){
56
    int c=color[u];
57
    cnt[c]+=x;
58
    if (cnt[c]==0)
59
        color_sz--;
60
    else if (x==1&&cnt[c]==1)
61
        color_sz++;
62
}
63
void update(int u,int fa,int x,int depth,int lim=k){
64
    if (depth>lim)
65
        return ;
66
    revise(u,x);
67
    for (int v: G[u])
68
        if (v!=fa)
69
            update(v,u,x,depth+1,lim);
70
}
71

72
int ans[maxn+5];
73
void dsu_on_tree(int u,int fa,bool keep){
74
    for (int v: G[u])
75
        if (v!=fa&&v!=son[u])
76
            dsu_on_tree(v,u,false);
77
    if (son[u])
78
        dsu_on_tree(son[u],u,true);
79
    revise(u,1);
80
    for (int v: G[u])
81
        if (v!=fa&&v!=son[u])
82
            update(v,u,1,1);
83
    for (int v: T[u]){
84
        debug(u,v);
85
        revise(v,-1);
86
    }
87
    ans[u]=color_sz;
88
    if (keep==false){
89
        revise(u,-1);
90
        update(son[u],u,-1,1);
91
        for (int v: G[u])
92
            if (v!=fa&&v!=son[u])
93
                update(v,u,-1,1);
94
    }
95
}
96

97
void solve(void){
98
  cin>>n>>k;
99
    for (int i=1;i<=n;i++)
100
        cin>>color[i];
101
    for (int i=1,u,v;i<n;i++){
102
        cin>>u>>v;
103
        G[u].push_back(v);
104
        G[v].push_back(u);
105
    }
106
    rebuild(1,0);
107
    connect(1,0);
108
        dsu_on_tree(1,0,true);
109
    int q,u;
110
    cin>>q;
111
    while (q--){
112
        cin>>u;
113
            cout<<ans[u]<<endl;
114
    }
115
}
116

117
int main(){
118
  std::ios::sync_with_stdio(false);
119
  std::cin.tie(nullptr);
120
  std::cout.tie(nullptr);
121
  int t=1;
122
//  cin>>t;
123
  while (t--)
124
    solve();
125
//    cout<<(solve()?"YES":"NO")<<endl;
126
  return 0;
127
}