#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
using i64 = long long;
using u64 = unsigned long long;
#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--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
template<class R> auto ComparingBy(R f){ return [g=std::move(f)](auto l, auto r) -> bool { return g(l) < g(r); }; }
#include <atcoder/modint>
#include <atcoder/dsu>
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    int N; cin >> N;
    vector<int> P(N);
    for(int i=1; i<N; i++){
        int p; cin >> p; p--;
        P[i] = p;
    }
    string s; cin >> s; s = "." + s;
    int K; cin >> K;
    vector<pair<int,int>> A(K);
    for(auto& [u,v] : A){ cin >> u >> v; u--; v--; }
    vector<int> X(N);
    for(int i=1; i<N; i++) if(s[i] == '#'){
        X[i] ^= 1;
        X[P[i]] ^= 1;
    }
    auto dsu = atcoder::dsu(N);
    for(auto [u,v] : A) dsu.merge(u,v);
    bool ans = false;
    vector<int> Q(N);
    rep(i,N) Q[dsu.leader(i)] ^= X[i];
    bool q = true;
    rep(i,N) if(Q[i] != 0) q = false;
    if(q) ans = true;
    cout << yn(ans) << endl;
}

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