#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define per(i, r, l) for (int i = r; i >= l; --i)
using namespace std;
const int N = 100005;
int T;
int n;
vector<int> E[N];
int dep[N];
int f[N][20];
void dfs(int u, int fa) {
    dep[u] = dep[fa] + 1;
    f[u][0] = fa;
    rep(i, 1, 19) { f[u][i] = f[f[u][i - 1]][i - 1]; }
    for (auto v : E[u]) {
        if (v == fa) continue;
        dfs(v, u);
    }
}
int lca(int x, int y) {
    if (dep[x] < dep[y]) swap(x, y);
    per(i, 19, 0) {
        if (dep[x] - dep[y] >= (1 << i)) x = f[x][i];
    }
    per(i, 19, 0) {
        if (f[x][i] != f[y][i]) {
            x = f[x][i], y = f[y][i];
        }
    }
    return x == y ? x : f[x][0];
}
int dis(int x, int y) { return dep[x] + dep[y] - dep[lca(x, y)] * 2; }

int p[N];

int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        rep(i, 1, n) { E[i].clear(); }
        rep(i, 1, n - 1) {
            int u, v;
            scanf("%d%d", &u, &v);
            E[u].push_back(v);
            E[v].push_back(u);
        }
        dfs(1, 0);
        rep(i, 1, n) { scanf("%d", &p[i]); }
        bool ans = true;
        rep(i, 1, n - 1) {
            // printf("%d ", dis(p[i], p[i + 1]));
            if (dis(p[i], p[i + 1]) > 3) ans = false;
        }
        printf("%d\n", ans);
    }

    return 0;
}