#include <bits/stdc++.h>
using namespace std;

const int N = 2500 + 5;

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

int n, m;

int id[N * 4][4], C[N * 4], X[N * 4], Y[N * 4], who[N][4];

int chg(char c) {
    if(c == 'W') return 3;
    if(c == 'E') return 2;
    if(c == 'S') return 1;
    return 0;
}

int le[4][3];

int get(int x, int y) {
    for(int i = 0; i < 4; ++ i) {
        if(dx[i] == x && dy[i] == y) {
            return i;
        }
    }
    throw;
    return -1;
}

int cur, d;
char s[10];
bool vis[N][4];

void print(int c) {
    printf("%d %d\n", X[c], Y[c]);
    exit(0);
}

int getdir(int des, int d) {
    int cnt = 0;
    bool ok[4] = {0, 0, 0, 0};
    for(int dd = 0; dd < 4; ++ dd) if(dd != (d ^ 1)) {
        if(!id[des][dd] || !C[id[des][dd]]) continue;
        ok[dd] = 1;
        ++ cnt;
    }
    if(!cnt) {
        print(des);
        return 0;
    }
    if(cnt == 3) {
        return d;
    }

    if(cnt == 2) {
        if(!ok[le[d][0]]) return le[d][1];
        else return le[d][0];
    } else {
        for(int dd = 0; dd < 4; ++ dd)
        if(ok[dd]) d = dd;
    }    
    return d;
}

bool del = 0;

void refresh() {
    del = 0;
    memset(vis, 0, sizeof(vis));
    while(!vis[cur][d]) {
        vis[cur][d] = 1; 
        if(!C[id[cur][d]]) {
            print(cur);
            return;
        }
        -- C[id[cur][d]];
        if(!C[id[cur][d]]) {
            del = 1;
        }
        int des = who[cur][d];
        d = getdir(des, d);
        cur = des;
    }
    memset(vis, 0, sizeof(vis));
    while(!vis[cur][d]) {
        vis[cur][d] = 1; 
        if(!C[id[cur][d]]) {
            print(cur);
            return;
        }
        -- C[id[cur][d]];
        if(!C[id[cur][d]]) {
            del = 1;
        }
        int des = who[cur][d];
        d = getdir(des, d);
        cur = des;
    }
    memset(vis, 0, sizeof(vis));
    while(!vis[cur][d]) {
        vis[cur][d] = 1; 
        if(!C[id[cur][d]]) {
            print(cur);
            return;
        }
        -- C[id[cur][d]];
        if(!C[id[cur][d]]) {
            del = 1;
        }
        int des = who[cur][d];
        d = getdir(des, d);
        cur = des;
    }
    memset(vis, 0, sizeof(vis));
    while(!vis[cur][d]) {
        vis[cur][d] = 1; 
        if(!C[id[cur][d]]) {
            print(cur);
            return;
        }
        -- C[id[cur][d]];
        if(!C[id[cur][d]]) {
            del = 1;
        }
        int des = who[cur][d];
        d = getdir(des, d);
        cur = des;
    }
    memset(vis, 0, sizeof(vis));
    while(!vis[cur][d]) {
        vis[cur][d] = 1; 
        if(!C[id[cur][d]]) {
            print(cur);
            return;
        }
        -- C[id[cur][d]];
        if(!C[id[cur][d]]) {
            del = 1;
        }
        int des = who[cur][d];
        d = getdir(des, d);
        cur = des;
    }
    memset(vis, 0, sizeof(vis));
    while(!vis[cur][d]) {
        vis[cur][d] = 1; 
        if(!C[id[cur][d]]) {
            print(cur);
            return;
        }
        -- C[id[cur][d]];
        if(!C[id[cur][d]]) {
            del = 1;
        }
        int des = who[cur][d];
        d = getdir(des, d);
        cur = des;
    }
    memset(vis, 0, sizeof(vis));
    while(!vis[cur][d]) {
        vis[cur][d] = 1; 
        if(!C[id[cur][d]]) {
            print(cur);
            return;
        }
        -- C[id[cur][d]];
        if(!C[id[cur][d]]) {
            del = 1;
        }
        int des = who[cur][d];
        d = getdir(des, d);
        cur = des;
    }
}

int main() {
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++ i) {
        scanf("%d%d", &X[i], &Y[i]);
    }

    le[1][0] = 2, le[1][1] = 1, le[1][2] = 3;
    le[0][0] = 3, le[0][1] = 0, le[0][2] = 2;
    le[2][0] = 0, le[2][1] = 2, le[2][2] = 1;
    le[3][0] = 1, le[3][1] = 3, le[3][2] = 0;

    for(int i = 1, x, y, z; i <= m; ++ i) {
        scanf("%d%d%d", &x, &y, &z);
        C[i] = z;
        int dx = X[y] - X[x], dy = Y[y] - Y[x];
        if(dx) dx /= abs(dx); if(dy) dy /= abs(dy);
        id[x][get(dx, dy)] = i; who[x][get(dx, dy)] = y;
        id[y][get(-dx, -dy)] = i; who[y][get(-dx, -dy)] = x;
    }

    scanf("%d", &cur);
    scanf("%s", s);

    d = chg(s[0]);
    del = 1;
    
    while(1) {
        while(del) refresh();
        vector <int> e;
        memset(vis, 0, sizeof(vis));
        int ld = -1, lw = 0;
        while(!vis[cur][d]) {
            vis[cur][d] = 1; 
            if(!C[id[cur][d]]) {
                print(cur);
                return 0;
            }
            e.push_back(id[cur][d]);
            int des = who[cur][d];
            int ddd = d;
            d = getdir(des, d);
            if(vis[des][d]) ld = ddd, lw = cur;
            cur = des;
        }

        int now = 1e9;
        for(auto x : e) {
            now = min(now, C[x]);
        }
        for(auto x : e) {
            C[x] -= now;
        }

        del = 1;
        
        d = getdir(cur, ld);
        cur = cur;
    }
}