#include <bits/stdc++.h>

#include <atcoder/dsu>

using namespace std;

void Solve() {
  int n;
  cin >> n;
  vector<int> p(n, -1);
  vector<vector<int>> C(n);
  for (int i = 1; i < n; ++i) {
    cin >> p[i];
    --p[i];
    C[p[i]].push_back(i);
  }
  string s(n, '?');
  for (int i = 1; i < n; ++i) {
    cin >> s[i];
  }

  vector<int> f(n);
  for (int i = n; 1 < i--;) {
    if (s[i] == '#') {
      f[i] ^= 1;
      f[p[i]] ^= 1;
    }
  }

  atcoder::dsu d(n);
  int k;
  cin >> k;
  while (k--) {
    int i, j;
    cin >> i >> j;
    --i, --j;
    if (d.same(i, j)) {
      continue;
    }
    i = d.leader(i);
    j = d.leader(j);
    f[d.merge(i, j)] = f[i] ^ f[j];
  }

  for (int i = 0; i < n; ++i) {
    if (d.leader(i) != i) {
      continue;
    }
    if (d.same(0, i)) {
      continue;
    }
    if (f[i]) {
      cout << "No\n";
      return;
    }
  }
  cout << "Yes\n";
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  Solve();
}