#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

void dfs(vector<bool> &isvisited, vector<vector<pll>> &graph,
         vector<ll> &e_cols, vector<ll> &v_cols, ll v) {
    isvisited[v] = true;
    ll col = 0;
    ll next_col = 0;
    for (ll i = 0; i < graph[v].size(); i++) {
        ll x = graph[v][i].first;
        ll x_col = e_cols[graph[v][i].second];
        if (isvisited[x]) {
            col = x_col;
            continue;
        } else {
            next_col ^= x_col;
            dfs(isvisited, graph, e_cols, v_cols, x);
        }
    }
    v_cols[v] = col ^ next_col;
}

int main() {
    ll N;
    cin >> N;
    vector<ll> P(N - 1);
    for (ll i = 0; i < N - 1; i++) {
        cin >> P[i];
        P[i]--;
    }
    string S;
    cin >> S;
    vector<ll> e_cols(N - 1, 0);
    for (ll i = 0; i < N - 1; i++) {
        if (S[i] == '#') {
            e_cols[i] = 1;
        }
    }
    ll Q;
    cin >> Q;
    vector<ll> U(Q);
    vector<ll> V(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> U[i] >> V[i];
        U[i]--;
        V[i]--;
    }
    vector<vector<pll>> graph(N, vector<pll>(0));
    for (ll i = 0; i < N - 1; i++) {
        graph[i + 1].push_back(pll(P[i], i));
        graph[P[i]].push_back(pll(i + 1, i));
    }
    vector<ll> v_cols(N, -1);
    vector<bool> isvisited(N, false);
    dfs(isvisited, graph, e_cols, v_cols, 0);
    // debug(v_cols);
    dsu tree(N);
    for (ll i = 0; i < Q; i++) {
        tree.merge(U[i], V[i]);
    }
    vector<ll> cc_cols(N, 0);
    for (ll i = 0; i < N; i++) {
        cc_cols[tree.leader(i)] += v_cols[i];
    }
    bool ans = true;
    for (ll i = 0; i < N; i++) {
        if (cc_cols[i] % 2 != 0) {
            ans = false;
        }
    }
    if (ans) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}