#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

#include <atcoder/dsu>

using ll = long long;

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int N;
    cin >> N;
    vector<vector<int>> G(N);
    for (int i = 1; i < N; i++) {
        int P;
        cin >> P;
        G[--P].emplace_back(i);
    }
    string s;
    cin >> s;
    vector<int> S(N);
    for (int i = 1; i < N; i++) S[i] = (s[i - 1] == '#');
    S[0] = 0;
    auto dfs = [&](auto self, int v) -> void {
        for (int& u : G[v]) {
            S[v] ^= S[u];
            self(self, u);
        }
    };
    dfs(dfs, 0);
    debug(S);

    atcoder::dsu dsu(N);
    int K;
    cin >> K;
    for (; K--;) {
        int U, V;
        cin >> U >> V;
        dsu.merge(--U, --V);
    }
    vector<int> sum(N, 0);
    for (int i = 0; i < N; i++) sum[dsu.leader(i)] ^= S[i];
    for (int i = 0; i < N; i++) {
        if (sum[i] == 1) {
            cout << "No\n";
            return 0;
        }
    }

    cout << "Yes\n";
    return 0;
}