#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 100447;

set<int> g[N];
int p[N];

void dfs(int v, int par)
{
	p[v] = par;
	for (auto to : g[v])
		if (to != par)
			dfs(to, v);
}

bool check(int a, int b)
{
	bool ok = false;
	FOR (x, 0, 3)
	{
		ok |= g[a].count(b);
		a = p[a];
	}
	return ok;
}

void solve()
{
	int n;
	cin >> n;
	FOR (i, 0, n - 1)
	{
		int a, b;
		cin >> a >> b;
		a--, b--;
		g[a].insert(b);
		g[b].insert(a);
	}
	VI a(n);
	FOR (i, 0, n)
	{
		cin >> a[i];
		a[i]--;
	}
	dfs(0, 0);
	bool ok = true;
	FOR (i, 0, n - 1)
	{
		ok &= check(a[i], a[i + 1]) | check(a[i + 1], a[i]);
	}
	cout << ok << '\n';
	FOR (i, 0, n)
	{
		g[i].clear();
	}
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	
	return 0;
}