//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

int mp[22][22];

int main(){
	int N,M;
	int x[]={0,1,0,-1};
	int y[]={1,0,-1,0};
	while(cin>>N){
		if(N==0)break;
		CLR(mp);
		REP(i,N){
			int tx,ty;
			cin>>tx>>ty;
			mp[tx][ty]++;
		}
		cin>>M;
		
		int nx=10,ny=10;
		int res=0;
		REP(k,M){
			
			char d;int l;
			cin>>d>>l;
			int rx,ry;
			if(d=='N'){
				rx=x[0]*l;
				ry=y[0]*l;
			}else if(d=='E'){
				rx=x[1]*l;
				ry=y[1]*l;
			}else if(d=='S'){
				rx=x[2]*l;
				ry=y[2]*l;
			}else{
				rx=x[3]*l;
				ry=y[3]*l;
			}
			if(rx<0||ry<0){
				for(int i=0;i>=rx;i--)for(int j=0;j>=ry;j--){
					if(mp[nx+i][ny+j]!=0){
						mp[nx+i][ny+j]=0;
						//cout<<"!"<<nx+i<<" "<<ny+j<<endl;
						res++;
					}
				}
			}else{
				for(int i=0;i<=rx;i++)for(int j=0;j<=ry;j++){
					if(mp[nx+i][ny+j]!=0){
						mp[nx+i][ny+j]=0;
						//cout<<"!"<<nx+i<<" "<<ny+j<<endl;
						res++;
					}
				}
			}
			nx+=rx;ny+=ry;
		}
		if(res==N)cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
	return 0;
}
#include<stdio.h>
int main(void)
{
  for(;;){
    int houkosu={0};
    int comkosu={0};
    int hou[21][21]={{0},{0}};
    int zahyo[21][21]={{0},{0}};
    int mypox={10};
    int mypoy={10};
    int x={0},y={0};
    int i={0},j={0};
    char dire={0};
    int dis={0};
    int hantei={0};
    char dir[31]={0};
    int di[31]={0};
     
    scanf("%d",&houkosu);
    if(houkosu==0)
      break;
       
    for(i=0;i<houkosu;i++){
      scanf("%d %d",&x,&y);
      hou[x][y]=1;
    }
 
    scanf("%d",&comkosu);
     
    hou[10][10]=0;
    for(i=0;i<2*comkosu;i++){
      scanf("%c",&dire);
      dir[i/2]=dire;
      scanf("%d",&dis);
      di[(i-1)/2]=dis;
    }
     
    for(i=0;i<comkosu;i++){
 
      if(dir[i]=='N'){
        for(j=mypoy+1;j<=mypoy+di[i];j++){
          if(hou[mypox][j]==1)
            hou[mypox][j]=0;
        }
        mypoy+=di[i];
      }else if(dir[i]=='S'){
        for(j=mypoy-1;j>=mypoy-di[i];j--){
          if(hou[mypox][j]==1)
            hou[mypox][j]=0;
        }
        mypoy-=di[i];
      }else if(dir[i]=='E'){
        for(j=mypox+1;j<=mypox+di[i];j++){
          if(hou[j][mypoy]==1)
            hou[j][mypoy]=0;
        }
        mypox+=di[i];
      }else{
        for(j=mypox-1;j>=mypox-di[i];j--){
          if(hou[j][mypoy]==1)
            hou[j][mypoy]=0;
        }
        mypox-=di[i];
      }
    }
     
    for(i=0;i<21;i++){
      for(j=0;j<21;j++){
        if(hou[i][j]!=0)
          hantei=1;
      }
    }
     
    if(hantei==0)
      puts("Yes");
    else
      puts("No");
     
  }
  return 0;
}