#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<queue>
#include<map>
#include<set>
#include<complex>
#include<sstream>
#include<iterator>
#include<cstdlib>
#include<bitset>

using namespace std;

string dir = "NESW";
int dx[] = {0 , 1 , 0 , -1};
int dy[] = {1 , 0 , -1 , 0};

int main()
{
  int n ; 
  while(cin >> n && n)
    {
      int x[n] , y[n];
      bool flg[n]; fill(flg, flg + n ,false);
      int nn = n;
      for(int i = 0 ; i < n ; i++)
	{
	  cin >> x[i] >> y[i];
	  if(x[i]==10 && y[i]==10)
	    flg[i] = true , nn--;
	}
      int m ; cin >> m;
      bool ans = false;
      int px = 10 , py = 10;
      while(m--)
	{
	  char c ; int step ;
	  cin >> c >> step;
	  int idx = dir.find(c);
	  while(step--){
	    px += dx[idx];
	    py += dy[idx];
	    for(int i = 0 ; i < n ; i++)
	      {
		if(flg[i]) continue;
		if(x[i]==px && y[i] == py)
		  {
		    flg[i] = true; nn--;
		  }
	      }
	  }
	}
      ans = (nn == 0);
      puts(ans?"Yes":"No");
    }
  return 0;
}