#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <cstring>
#include <cmath>
#include <deque>
#include <algorithm>
#include <iostream>
#include <set>

using namespace std;

typedef long long int lint;
typedef long long ll;

long long dx[] = {-1,0,1,0};
long long dy[] = {0,-1,0,1};

bool pole[104][104][5][12]; //x,y,otocenie,v prikazu
vector<string> mapa;
string prikazy;
lint n, m; // n je riadok

struct usecka{
		pair<ll, ll> a;
		pair<ll, ll> b;
	};

ll vzdial(pair<ll, ll>& a, pair<ll, ll>& b){
		return abs(a.first - b.first) + abs(a.second - b.second);
	}

bool v_mape(ll x, ll y){
		if(x>=0 && y>=0 && x <n && y < m && mapa[x][y]!='X')
			return true;
		return false;
	}

bool operator < (usecka const& u1, usecka const& u2)
{
	return make_pair(u1.a, u1.b) < make_pair(u2.a, u2.b);
}

bool operator == (usecka const& u1, usecka const& u2)
{
	return make_pair(u1.a, u1.b) == make_pair(u2.a, u2.b);
}

bool rovnobezne(const usecka & aa, const usecka & bb){
		ll a = abs(aa.a.first - aa.b.first);
		ll b = abs(aa.a.second - aa.b.second);
		
		ll c = abs(bb.a.first - bb.b.first);
		ll d = abs(bb.a.second - bb.b.second);
		
		//printf("%d %d %d %d\n",a,b,c,d);
		
		if(a == 0 && c==0)
			return true;

		if(b == 0 && d==0)
			return true;
		if(a!= 0 && b!= 0 && c!= 0 && d!= 0 && a*d == c*b)
			return true;
		return false;
	}

bool check(usecka u, set<usecka> & usecky){
		set<usecka>::iterator it = usecky.begin();
		while(it != usecky.end()){
				if(rovnobezne(*it, u)){
						usecka t;
						t.a = (*it).a;
						t.b = u.a;
						if(rovnobezne(t,u)){
								vector<pair<pair<ll,ll>, ll> > vs;
								vs.push_back(make_pair(u.a,1)); 
								vs.push_back(make_pair(u.b,1));
								vs.push_back(make_pair((*it).a,2));
								vs.push_back(make_pair((*it).b,2));
								sort(vs.begin(), vs.end());
								if(vs[0].second != vs[1].second || vs[1].first == vs[2].first){
										usecky.erase(it);
										usecka nov;
										nov.a = vs[0].first;
										nov.b = vs[3].first;
										usecky.insert(nov);
										return true;
									}
							}
					}
				it++;
			}
		return false;
	}

ostream& operator << (ostream& out, usecka const & a){
		out<<"["<<a.a.first<<", "<<a.a.second<<"]:["<<a.b.first<<", "<<a.b.second<<"] ";
		return out;
	}

int main()
{
	while(scanf("%lld\n",&n) == 1){
			set<usecka> usecky, usecky2;
			char c; 
			ll x, y ,cx = 0, cy = 0;
			while(n--){
					scanf("%c%lld%lld\n",&c,&x,&y);
					//cout<<c<<" "<<x<<" "<<y<<endl;
					usecka u;
					u.a = make_pair(cx,cy);
					cx += x;
					cy += y;
					if(c == 'L'){
							u.b = make_pair(cx,cy);
							if(check(u, usecky) == false){
									usecky.insert(u);
								}
						}
						
				}
				
			scanf("%lld\n",&n);
			cx = 0, cy = 0;
			while(n--){
					scanf("%c%lld%lld\n",&c,&x,&y);
					usecka u;
					u.a = make_pair(cx,cy);
					cx += x;
					cy += y;
					if(c == 'L'){
							u.b = make_pair(cx,cy);
							if(check(u, usecky2) == false){
									usecky2.insert(u);
								}
						}
						
				}
			set<usecka>::iterator it = usecky.begin();
			pair<ll,ll> najl = make_pair(1000000,100000);
			while(it != usecky.end()){
					najl.first = min(najl.first, it->a.first);
					najl.first = min(najl.first, it->b.first);
					najl.second = min(najl.second, it->a.second);
					najl.second = min(najl.second, it->b.second);
					it++;
				}
				
			it = usecky2.begin();
			pair<ll,ll> najl2 = make_pair(1000000,100000);
			while(it != usecky2.end()){
					najl2.first = min(najl2.first, it->a.first);
					najl2.first = min(najl2.first, it->b.first);
					najl2.second = min(najl2.second, it->a.second);
					najl2.second = min(najl2.second, it->b.second);
					it++;
				}
			
			it = usecky.begin();
			set<usecka> usecky3,usecky4;
			while(it != usecky.end()){
					usecka nov, nov2;
					nov.a = (*it).b;
					nov.b = (*it).a;
					nov.a.first-=najl.first;
					nov.b.first-=najl.first;
					nov.a.second-=najl.second;
					nov.b.second-=najl.second;
					
					nov2 = nov;
					nov2.a = nov.b;
					nov2.b = nov.a;
					usecky3.insert(nov);
					usecky3.insert(nov2);
					//cout<<nov<<endl;
					it++;
				}
				
			it = usecky2.begin();
			while(it != usecky2.end()){
					usecka nov, nov2;
					nov.a = (*it).b;
					nov.b = (*it).a;
					nov.a.first-=najl2.first;
					nov.b.first-=najl2.first;
					nov.a.second-=najl2.second;
					nov.b.second-=najl2.second;
					
					nov2 = nov;
					nov2.a = nov.b;
					nov2.b = nov.a;
					usecky4.insert(nov);
					usecky4.insert(nov2);
					it++;
					//cout<<nov<<endl;
				}				
			if(equal(usecky3.begin(), usecky3.end(), usecky4.begin())){
					printf("YES\n");
				}	
				else 
					printf("NO\n");
		}
}