#include <bits/stdc++.h>

using namespace std;

int N, M;
bool feeld[25][25];

void solve() {
	int x = 10, y = 10;
	for (int i = 0; i < M; i++) {
		char c;
		int d;
		
		cin >> c >> d;
		if (c == 'N') {
			for (int j = 0; j < d; j++) {
				feeld[++y][x] = 0;
			}
		}
		if (c == 'E') {
			for (int j = 0; j < d; j++) {
				feeld[y][++x] = 0;
			}
		}
		if (c == 'S') {
			for (int j = 0; j < d; j++) {
				feeld[--y][x] = 0;
			}
		}
		if (c == 'W') {
			for (int j = 0; j < d; j++) {
				feeld[y][--x] = 0;
			}
		}
	}
	
	bool isok = true;
	for (int i = 0; i <= 20; i++) {
		for (int j = 0; j <= 20; j++) {
			isok *= !feeld[i][j];
		}	
	}
	
	if (isok) cout << "Yes" << endl;
	else cout << "No" << endl;
}

int main() {
	while (1) {
		cin >> N; if (N == 0) break;
		
		memset(feeld, 0, sizeof(feeld));
		for (int i = 0; i < N; i++) {
			int x, y; cin >> x >> y;
			feeld[y][x] = 1;
		}
		
		cin >> M;
		solve();
	}
	
	return 0;
}
#include <bits/stdc++.h>

using namespace std;

#define TEMP_T template<typename T>
TEMP_T void sort(T& v){ sort(v.begin(), v.end()); }
TEMP_T void revs(T& v){ reverse(v.begin(), v.end()); }
TEMP_T void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TEMP_T T    cums(T& v){ T r(v.size()); partial_sum(v.begin(), v.end(), r); return r; }
TEMP_T void show(T& v, char delim=' ', char end='\n'){ for(int i=0; i<v.size()-1; i++) cout << v[i] << delim; cout << v[v.size()-1] << end; }
TEMP_T T    acum(vector<T>& v, T b=0){ return accumulate(v.begin(), v.end(), b); }
TEMP_T vector<T> inpt(int n){ vector<T> v(n); for (int i=0; i<n; i++) cin >> v[i]; return v; }

static inline int in(){ int x; scanf("%d", &x); return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};

struct Field {
  Field(int w, int h) : w(w), h(h) {}
  bool invalid(int x, int y){ return x < 0 || w <= x || y < 0 || h <= y; }
  const int w, h;
};

struct Solver {
  Solver(){}
  int solve(){
  }
};

int main()
{
  int n;
  while (n = in()){
    int robo_x, robo_y;
    robo_x = robo_y = 10;
    set<pair<int, int> > gems;
    for (int i = 0; i < n; i++){
      int x, y;
      x = in();
      y = in();
      gems.insert(make_pair(x, y));
    }
    set<pair<int, int> > robos;
    int m = in();
    for (int i = 0; i < m; i++){
      string s;
      int v;
      int d;
      cin >> s >> v;

      if (s == "N") d = 0;
      else if (s == "W") d = 3;
      else if (s == "E") d = 2;
      else d = 1;
      for (int j = 0; j < v; j++){
        robos.insert(make_pair(robo_x, robo_y));
        robo_x += dx[d];
        robo_y += dy[d];
        robos.insert(make_pair(robo_x, robo_y));
      }
    }
    vector<pair<int, int> > mult;
    set_intersection(gems.begin(), gems.end(),
        robos.begin(), robos.end(),
        back_inserter(mult)
        );

    if (mult.size() == gems.size()){
      puts("Yes");
    }
    else puts("No");
  }

  return (0);
}