#include<iostream>
#include <set>
#include <algorithm>
int main(){
  while(true){
    int N;
    std::cin >> N;
    if(N == 0){break;}
    std::pair<int, int> points[N];
    for(int i = 0; i < N; i++){
      int x, y;
      std::cin >> x >> y;
      points[i] = std::make_pair(x, y);
    }
    int M;
    std::cin >> M;
    int current_x = 10;
    int current_y = 10;
    bool flag[N];
    std::fill(&flag[0], &flag[N], false);
    for(int i = 0; i < M; i++){
      char c;
      int l;
      std::cin >> c;
      std::cin >> l;
      int sx = 0, sy = 0;
      if(c == 'N'){sy = 1;}
      if(c == 'S'){sy = -1;}
      if(c == 'E'){sx = 1;}
      if(c == 'W'){sx = -1;}

      for(int j = 0; j < l; j++){
	current_x += sx;
	current_y += sy;
	for(int k = 0; k < N; k++){
	  if(points[k].first == current_x and
	     points[k].second == current_y){
	    flag[k] = true;
	  }
	}
      }
    }
    for(int i = 0; ; i++){
      if(i == N){std::cout << "Yes" << std::endl; break;}
      if(flag[i] == false){
	std::cout << "No" << std::endl;
	break;
      }
    }
  }
}