import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int root(int[] uf, int u) { return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u])); } bool connect(int[] uf, int u, int v) { u = uf.root(u); v = uf.root(v); if (u == v) return false; if (uf[u] > uf[v]) swap(u, v); uf[u] += uf[v]; uf[v] = u; return true; } void main() { try { for (; ; ) { const N = readInt; auto P = new int[N]; P[0] = -1; foreach (u; 1 .. N) { P[u] = readInt - 1; } const S = "." ~ readToken; const K = readInt; auto U = new int[K]; auto V = new int[K]; foreach (k; 0 .. K) { U[k] = readInt - 1; V[k] = readInt - 1; } auto uf = new int[N]; uf[] = -1; foreach (k; 0 .. K) { uf.connect(U[k], V[k]); } auto fs = new int[N]; foreach (u; 1 .. N) if (S[u] == '#') { fs[uf.root(P[u])] ^= 1; fs[uf.root(u)] ^= 1; } const ans = fs.all!"a == 0"; writeln(ans ? "Yes" : "No"); } } catch (EOFException e) { } }