#ifndef LOCAL
#include <bits/stdc++.h>
#define debug(...)
#endif

using namespace std;
#define cinv(v) for (auto &it:v) cin>>it;
#define coutv(v) for (auto &it:v) cout<< it<<' '; cout<<'\n';

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e5 + 5;
int arr[N], ans[N], sz[N];
vector<int> adj[N];
ordered_set<int>st[N];
int naam[N];
void dfs(int u, int par) {
    st[naam[u]].insert(arr[u]);
    sz[u] = 1;
    for(auto v : adj[u]) {
        if(v == par) continue;
        dfs(v, u);
        if(st[naam[v]].size() > st[naam[u]].size()) swap(naam[u], naam[v]);
        for(auto x : st[naam[v]]) {
            st[naam[u]].insert(x);
        }
        sz[u] += sz[v];
    }
    ans[u] = sz[u] - st[naam[u]].order_of_key(sz[u] + 1);
}
// auto dfs = [&](auto &&self, int u, int par)-> ordered_set<int> {
    //     ordered_set<int> ret;
    //     ret.insert(arr[u]);
    //     sz[u] = 1;
    //     for (auto &v: adj[u]) {
    //         if (v == par) continue;
    //         ordered_set<int> o = self(self, v, u);
    //         if (o.size() > ret.size()) swap(ret, o);
    //         for (auto &it: o) ret.insert(it);
    //         sz[u] += sz[v];
    //     }
    //     ans[u] = sz[u] - (ret.order_of_key(sz[u] + 1));
    //     return ret;
    // };
void shelby() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i], adj[i].clear();
        st[i].clear();
        naam[i] = i;
    }
    for (int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    
    dfs(1, -1);
    int q;
    cin >> q;
    while (q--) {
        int x;
        cin >> x;
        cout << ans[x] << '\n';
    }
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        // cout << "Case " << _ << ": ";
        shelby();
    }
}