#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>p(n);
	rep2(i, 1, n) {
		cin >> p[i];
		p[i]--;
	}
	string s; cin >> s;
	vector<bool>deg(n);
	rep2(i, 1, n) if('#' == s[i-1]){
		deg[i] = deg[i] ^ true;
		deg[p[i]] = deg[p[i]] ^ true;
	}
	dsu uf(n);
	int k; cin >> k;
	rep(i, k) {
		int u, v; cin >> u >> v;
		u--, v--;
		uf.merge(u, v);
	}
	bool chk = true;
	auto g = uf.groups();
	for (auto v : g) {
		bool p = false;
		for (auto e : v)p = p ^ deg[e];
		if (p)chk = false;
	}
	cout << (chk ? "Yes" : "No") << endl;
	return 0;
}