#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>

using namespace std;

const int MAXN = 100000;

vector<vector<int>> tree;
vector<int> A, in, out, euler_tour, sz;
vector<int> fenwick_tree(MAXN + 1, 0);
int timer = 0;

void dfs(int u, int p) {
    in[u] = timer++;
    euler_tour.push_back(A[u]);
    sz[u] = 1;
    for (int v : tree[u]) {
        if (v != p) {
            dfs(v, u);
            sz[u] += sz[v];
        }
    }
    out[u] = timer - 1;
}

void update(int idx, int val) {
    while (idx <= MAXN) {
        fenwick_tree[idx] += val;
        idx += idx & -idx;
    }
}

int query(int idx) {
    int sum = 0;
    while (idx > 0) {
        sum += fenwick_tree[idx];
        idx -= idx & -idx;
    }
    return sum;
}

int solve(int x) {
    int S = sz[x];
    unordered_map<int, int> node_freq;

    for (int i = in[x]; i <= out[x]; ++i) {
        node_freq[euler_tour[i]]++;
    }

    int missing = 0;
    for (int i = 1; i <= S; ++i) {
        if (node_freq[i] == 0) {
            missing++;
        }
    }
    return missing;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;

    while (T--) {
        int N;
        cin >> N;

        A.resize(N);
        for (int i = 0; i < N; ++i) {
            cin >> A[i];
        }

        tree.clear();
        tree.resize(N);

        for (int i = 0; i < N - 1; ++i) {
            int u, v;
            cin >> u >> v;
            u--; v--;
            tree[u].push_back(v);
            tree[v].push_back(u);
        }

        sz.clear();
        sz.resize(N, 0);
        in.clear();
        out.clear();
        in.resize(N, -1);
        out.resize(N, -1);
        euler_tour.clear();

        timer = 0;
        dfs(0, -1);

        int Q;
        cin >> Q;

        while (Q--) {
            int x;
            cin >> x;
            x--;
            cout << solve(x) << "\n";
        }
    }

    return 0;
}