#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

struct Edge
{
	int from, to, w;
};
vector<Edge> e;

const int N = 4774;
int x[N], y[N];
//<v>^
int id[N][4];
bool used[N][4];


void addEdge(int i, int j, int w)
{
	int tIJ = (x[i] == x[j]);
	if(MP(x[i], y[i]) < MP(x[j], y[j]))
		tIJ ^= 2;
	int tJI = tIJ ^ 2;


	id[i][tIJ] = SZ(e);
	e.PB({i, j, w});
	id[j][tJI] = SZ(e);
	e.PB({j, i, w});	
}

int where(int from, int to, int t)
{
	assert(to != -1);
	
	int cnt = 0;
	FOR(j, 0, 4)
	{
		if(j != (t ^ 2))
			cnt += id[to][j] != -1;
	}
	if(cnt == 0)
		return -1;
	if(cnt == 1)
	{
		FOR(j, 0, 4)
		{
			if((j ^ 2) == t)
				continue;
			if(id[to][j] != -1)
				return j;
		}
		assert(0);
	}	
	if(cnt == 3)
	{
		return t;
	}
	if(cnt == 2)
	{	
		FOR(j, 1, 4)
		{
			int res = ((t ^ 2) - j + 4) % 4;
			if(id[to][res] != -1)
			{
				assert((res ^ 2) != t);
				return res;
			}
		}
		assert(0);
	}
	assert(0);
} 

const int INF = 1e9;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, m;
	cin >> n >> m;
	FOR(i, 0, n)
	{
		cin >> x[i] >> y[i];
		fill(id[i], id[i] + 4, -1);
	}
	FOR(i, 0, m)
	{
		int a, b, w;
		cin >> a >> b >> w;
		addEdge(a - 1, b - 1, w);
	}
	
	char ch;
	int v, t = 0;
	
	cin >> v >> ch;
	v--;
	if(ch == 'E' || ch == 'N')
		t ^= 2;
	if(ch == 'S' || ch == 'N')
		t ^= 1;
	
	VI cnt(m, 0);
	
	vector<PII> st;
	st.reserve(4 * n);
	while(true)
	//FOR(it, 0, 1)
	{
		st.clear();
		bool del = false;
		while(t != -1 && !used[v][t])
		{
			st.PB({v, t});
			used[v][t] = 1;
			
			int i = id[v][t];
			assert(i != -1);
			int to = e[i].to;
			
			e[i].w--;
			e[i ^ 1].w--;
			if(e[i].w == 0)
			{
				id[v][t] = -1;
				id[to][t ^ 2] = -1;
				
				t = where(v, to, t);
				v = to;
				del = true;
				break;
			}
			t = where(v, to, t);
			v = to;
		}
		for(auto [from, type] : st)
			used[from][type] = 0;
		if(del)
		{
			continue;
		}
		if(t == -1)
		{
			cout << x[v] << " " << y[v] << "\n";
			return 0;
		}
		
		
		vector<PII> cyc;
		while(SZ(cyc) == 0 || cyc.back() != MP(v, t))
		{
			cyc.PB(st.back());
			st.pop_back();
		}
		reverse(ALL(cyc));
		
		
		int num = INF;
		for(auto [from, type] : cyc)
		{
			int i = id[from][type];
			cnt[i / 2]++;
			
			num = min((e[i].w - 1) / cnt[i / 2], num);
		}
		for(auto [from, type] : cyc)
		{
			int i = id[from][type];
			assert(i != -1);
			cnt[i / 2]--;
			
			e[i].w -= num;
			e[i ^ 1].w -= num;
			
			assert(e[i].w > 0);
		}
	}
	return 0;
}