T621307's std

#include <bits/stdc++.h>
using namespace std;

void solve() {
    int T;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        vector<vector<int>> tree(n + 1);
        for (int i = 0; i < n - 1; ++i) {
            int x, y;
            cin >> x >> y;
            tree[x].push_back(y);
        }
        vector<int> a(n + 1);
        for (int i = 1; i <= n; ++i) {
            cin >> a[i];
        }

        bool is_palindrome_tree = true;
        vector<pair<int, unordered_map<int, int>>> stack;
        stack.emplace_back(1, unordered_map<int, int>());

        while (!stack.empty() && is_palindrome_tree) {
            auto [node, freq] = stack.back();
            stack.pop_back();
            unordered_map<int, int> new_freq = freq;
            new_freq[a[node]]++;

            if (tree[node].empty()) {
                int odd_count = 0;
                for (const auto& [key, val] : new_freq) {
                    if (val % 2 != 0) {
                        odd_count++;
                        if (odd_count > 1) {
                            break;
                        }
                    }
                }
                if (odd_count > 1) {
                    is_palindrome_tree = false;
                }
            } else {
                for (int child : tree[node]) {
                    stack.emplace_back(child, new_freq);
                }
            }
        }
        cout << (is_palindrome_tree ? "Yes" : "No") << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}