#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];

void shelby() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> arr[i], adj[i].clear();
    for (int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    auto dfs = [&](auto &&self, int u, int par)-> int {
        sz[u] = 1;
        for (auto &v: adj[u]) if (v != par) sz[u] += self(self, v, u);
        return sz[u];
    };
    dfs(dfs, 1, -1);

    auto dfs2 = [&](auto &&self, int u, int par)-> set<int> {
        set<int> ret{arr[u]};
        ans[u] = sz[u] - (arr[u] <= sz[u]);
        for (auto &v: adj[u]) {
            if (v == par) continue;
            set<int> st = self(self, v, u);
            for (auto &it: st) if (!ret.contains(it)) ret.insert(it), ans[u] -= (it <= sz[u]);
        }
        return ret;
    };
    dfs2(dfs2, 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();
    }
}