import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

void main() {
    while (true) {
        int n;
        scan(n);

        if (n == 0) return;

        auto map = new int[][](21, 21);

        foreach (i ; 0 .. n) {
            int xi, yi;
            scan(xi, yi);
            map[xi][yi]++;
        }

        int m;
        scan(m);

        int hsk;
        int px = 10, py = 10;

        foreach (i ; 0 .. m) {
            char di;
            int li;
            scan(di, li);

            foreach (j ; 0 .. li) {
                if (di == 'N') {
                    py++;
                }
                else if (di == 'S') {
                    py--;
                }
                else if (di == 'E') {
                    px++;
                }
                else {
                    px--;
                }

                hsk += map[px][py];
                map[px][py] = 0;
            }
            
        }

        debug {
            writeln(hsk);
        }

        writeln(hsk == n ? "Yes" : "No");
    }
}



void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}