import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.container;
import std.datetime;

void main()
{
	int n;
	while (n = readln.chomp.to!int, n) {
		auto jewels = new int[][](n, 2);
		auto f = new bool[](n);
		foreach (i; 0..n) {
			jewels[i] = readln.chomp.split.map!(to!int).array;
		}
		auto m = readln.chomp.to!int;
		int[2] rp;
		rp[] = 10;

		foreach (i; 0..m) {
			auto p = readln.chomp.split;
			auto d = p[1].to!int;
			if (p[0] == "N") {
				while (d--) {
					rp[1]++;
					foreach (j; 0..n) if (rp == jewels[j]) f[j] = 1;
				}
			} else if (p[0] == "S") {
				while (d--) {
					rp[1]--;
					foreach (j; 0..n) if (rp == jewels[j]) f[j] = 1;
				}
			} else if (p[0] == "E") {
				while (d--) {
					rp[0]++;
					foreach (j; 0..n) if (rp == jewels[j]) f[j] = 1;
				}
			} else {
				while (d--) {
					rp[0]--;
					foreach (j; 0..n) if (rp == jewels[j]) f[j] = 1;
				}
			} 
		}

		if (f.count!(a=>a==1) == n) writeln("Yes");
		else writeln("No");
	}
}