#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());


const ll INF = 1e9 + 5;
const int N = 1e5 + 5, mod = 1e9 + 7, SQ = 317, LOG = 18;

int lvl[N];
int up[N][LOG];
vector<int> G[N];

void dfs(int node, int par)
{
    for(int i = 1; i < LOG; i++)
        up[node][i] = up[up[node][i - 1]][i - 1];
    for(auto ch: G[node])
    {
        if(ch == par)
            continue;

        up[ch][0] = node;
        lvl[ch] = lvl[node] + 1;
        dfs(ch, node);
    }
}

int getKthParent(int node, int k)
{
    for(int i = LOG - 1; i >= 0; i--)
    {
        if((k >> i) & 1)
            node = up[node][i];
    }
    return node;
}

int LCA(int a, int b)
{
    if(lvl[a] < lvl[b])
        swap(a, b);

    a = getKthParent(a, lvl[a] - lvl[b]);

    if(a == b)
        return a;

    for(int i = LOG - 1; i >= 0; i--)
    {
        if(up[a][i] != up[b][i])
            a = up[a][i], b = up[b][i];
    }
    return up[a][0];
}

void clean(int n)
{
    for(int i = 1; i <= n; i++)
        G[i].clear(), lvl[i] = 0;
}

int dist(int u, int v)
{
    int lca = LCA(u, v);
    return (lvl[u] - lvl[lca]) + (lvl[v] - lvl[lca]);
}

void doWork()
{
    int n;
    cin >> n;
    clean(n);

    for(int i = 0, u, v; i < n - 1; i++)
        cin >> u >> v, G[u].push_back(v), G[v].push_back(u);

    up[1][0] = 1, dfs(1, -1);

    vector<int> p(n);
    bool valid = true;
    for(int i = 0; i < n; i++)
    {
        cin >> p[i];
        if(i)
            valid &= (dist(p[i], p[i - 1]) <= 3);
    }
    cout << valid << '\n';
}

signed main()
{
    FIO
    int T = 1;
    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}