Coloring Tree

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

// ----------- define --------------
// #define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define mp make_pair
#define pb push_back
#define pqueue priority_queue
#define popcnt __builtin_popcount
#define getBit(x, k) ((x >> k) & 1)
#define xorBit(x, k) (x ^ (1 << k))
#define siz(x) (int)((x).size())
#define all(x) (x).begin(),(x).end()
// ---------------------------------

const int N = 100005;

vector<int> adj[N];
int num[N], res[N];
set<int> s[N];

void dfs(int i, int p) {
  for (auto &j : adj[i]) {
    if (j == p) continue;
    dfs(j, i);
    if (s[i].size() < s[j].size()) {
      swap(s[i], s[j]);
    }
    for (auto &k : s[j]) {
      s[i].insert(k);
    }
  }
  s[i].insert(num[i]);
  res[i] = s[i].size();
}

void Main() {
  int n, m, r;
  cin >> n >> m >> r;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) {
    cin >> num[i];
  }
  dfs(r, 0);
  for (int i = 1; i <= m; i++) {
    int x; cin >> x;
    cout << res[x] << '\n';
  }
}

signed main() {
#ifdef _DEBUG
  // freopen("in" , "r", stdin );
  cerr << "- ---- -- ----- <3\n";
#endif
  cin.tie(0)->sync_with_stdio(0);
  int T = 1;
  // cin >> T;
  while (T--) Main();
}