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

void assert1(bool b) {
	if (not b) {
		sleep(10);
	}
}

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n, m; cin >> n >> m;
	vector<pair<int,int>> coords(n); for (auto &[l,r] : coords) cin >> l >> r;

	vector adj(n, vector(4, pair<int,int>(-1, 0)));
	while (m--) {
		int a, b, k; cin >> a >> b >> k; a--, b--;
		if (coords[a].first == coords[b].first) {
			if (coords[a].second > coords[b].second) {
				adj[a][2] = {b, k};
				adj[b][0] = {a, k};
			} else {
				adj[a][0] = {b, k};
				adj[b][2] = {a, k};
			}
		} else {
			if (coords[a].first > coords[b].first) {
				adj[a][3] = {b, k};
				adj[b][1] = {a, k};
			} else {
				adj[a][1] = {b, k};
				adj[b][3] = {a, k};
			}
		}
	}

	int cur; cin >> cur; cur--;
	int d;
	{
		char c; cin >> c;
		string DIRS = "NESW";
		d = DIRS.find(c);
	}
	while (1) {
begin:
		vector vis(n, vector(4, false));
		vector<pair<int,int>> hist;

		while (!vis[cur][d]) {
			bool reset = false;
			hist.emplace_back(cur,d);
			vis[cur][d] = true;

			int newcur = adj[cur][d].first;
			// assert1(adj[newcur][(d+2)%4].second == adj[cur][d].second); 
			if (not --adj[newcur][(d+2)%4].second) adj[newcur][(d+2)%4] = {-1, 0};
			if (not --adj[cur][d].second) adj[cur][d] = {-1, 0}, reset = true;
			cur = newcur;

			set<int> paths;
			for (int i = 0; i < 4; i++) if (adj[cur][i].first != -1) paths.emplace(i);
			paths.erase((d+2)%4);
			if (paths.empty()) {
				cout << coords[cur].first << ' ' << coords[cur].second << '\n';
				return 0;
			}
			if (paths.size() != 3) {
				for (int dd = (d+3)%4; ; dd=(dd+1)%4)
					if (paths.count(dd)) {
						d = dd;
						break;
					}
			}

			if (reset) goto begin;
		}

		int sub = INT_MAX;
		bool start = false;
		for (auto [c,e] : hist) {
			start |= c == cur and d == e;
			if (!start) continue;

			// assert1(adj[c][e].second > 0);
			if (vis[adj[c][e].first][(e+2)%4]) sub = min(sub, adj[c][e].second/2);
			else sub = min(sub, adj[c][e].second);
		}
		assert1(sub != INT_MAX);
		// assert1(sub >= 0 and sub < INT_MAX);

		start = false;
		for (auto [c,e] : hist) {
			start |= c == cur and d == e;
			if (!start) continue;

			adj[adj[c][e].first][(e+2)%4].second -= sub;
			adj[c][e].second -= sub;

			cur = adj[c][e].first, d = e;
			if (not adj[adj[c][e].first][(e+2)%4].second) adj[adj[c][e].first][(e+2)%4] = {-1, 0};
			if (not adj[c][e].second) adj[c][e] = {-1, 0};
		}

			set<int> paths; for (int i = 0; i < 4; i++) if (i != (d+2)%4 and adj[cur][i].first != -1) paths.emplace(i);
			if (paths.empty()) {
				cout << coords[cur].first << ' ' << coords[cur].second << '\n';
				return 0;
			}
			if (paths.size() != 3) {
				for (int dd = (d+3)%4; ; dd=(dd+1)%4)
					if (paths.count(dd)) {
						d = dd;
						break;
					}
			}
	}
}