#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
int a[2505],b[2505];
int nxt[2505][4];
int ins[100005];
int dfn[100005];
int DFN;
int tot[100005];
int sta[100005],tp,sta1[100005];
int tx[100005],ty[100005];
struct 
{
    int x,y,w;
}E[100005];
int n,m;
void walk(int &x,int &y)
{
    if (ins[nxt[x][y]])
    {
        int mn=inf;
        ++DFN;
        int tp1=0;
        int ny=ty[tp];
        while (1)
        {
            int u=sta[tp];
            ins[u]=0;
            tp--;
            if (dfn[u%m]!=DFN)
            {
                dfn[u%m]=DFN;
                tot[u%m]=0;
            }
            tot[u%m]++;
            mn=min(mn,E[u%m].w/tot[u%m]);
            // cerr<<"circle "<<mn<<" "<<E[u%m].w<<" "<<tot[u%m]<<endl;
            sta1[++tp1]=u%m;
            if (u==nxt[x][y]) break;
        }
        ++DFN;
        while (tp1)
        {
            int u=sta1[tp1];
            tp1--;
            if (dfn[u]!=DFN) E[u%m].w-=tot[u%m]*mn;
            dfn[u]=DFN;
        }
        y=(ny+2)%4;
        return;
    }
    // cout<<"./.. "<<x<<" "<<y<<endl;
    int u=nxt[x][y];
    // cout<<"??"<<x<<" "<<y<<" "<<u<<" "<<u%m<<endl;
    sta[++tp]=u;
    tx[tp]=x,ty[tp]=y;
    ins[u]=1;
    E[u%m].w--;

    if (E[u%m].w==0)
    {
        while (tp)
        {
            ins[sta[tp]]=0;
            tp--;
        }
    }
    if (u>=m) x=E[u%m].x;
    else x=E[u%m].y;

    y=(y+2)%4;
}
void BellaKira()
{
    cin>>n>>m;
    for (int i=1;i<=n;i++)
        cin>>a[i]>>b[i];
    for (int i=1;i<=n;i++)
        for (int j=0;j<4;j++) nxt[i][j]=-1;

    for (int i=0;i<m;i++)
    {
        cin>>E[i].x>>E[i].y>>E[i].w;
        int x=E[i].x,y=E[i].y;
        if (a[x]==a[y])
        {
            if (b[x]<b[y])
            {
                nxt[x][0]=i;
                nxt[y][2]=i+m;
            } else
            {
                nxt[x][2]=i;
                nxt[y][0]=i+m;
            }
        } else
        {
            if (a[x]<a[y])
            {
                nxt[x][1]=i;
                nxt[y][3]=i+m;
            } else
            {
                nxt[x][3]=i;
                nxt[y][1]=i+m;
            }
        }
    }
    int x;char c;
    cin>>x>>c;
    // cout<<"????"<<x<<" "<<endl;
    int y;
    if (c=='N') y=0;
    else if (c=='E') y=1;
    else if (c=='S') y=2;
    else y=3;

    walk(x,y);
    // return;
    int op=0;
    while (1)
    {
        int tt=0;
        int pos=-1;
        for (int i=1;i<4;i++)
            if (nxt[x][(y+i)%4]>=0&&E[nxt[x][(y+i)%4]%m].w) 
            {
                tt++;
                if (pos==-1) pos=(y+i)%4;
            }
        // ++op;
        // if (op<=2)
        // cout<<x<<" "<<a[x]<<","<<b[x]<<" "<<y<<" "<<tt<<" "<<pos<<" "<<E[nxt[x][y]%m].w<<endl;
        if (tt==0)
        {
            cout<<a[x]<<" "<<b[x]<<'\n';
            return;
        }
        if (tt<=2) y=pos,walk(x,y);
        else y=(y+2)%4,walk(x,y);
    }
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/