#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
const int MAX = 300003;
int X[MAX], Y[MAX], U[MAX], D[MAX];
bool V[MAX];
vector<int> G[MAX], RG[MAX];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int N, M, A, B;
cin >> N >> M >> A >> B;
for (int i = 1; i <= N; ++i) cin >> X[i] >> Y[i];
for (int i = 0; i < M; ++i) {
int a, b, c;
cin >> a >> b >> c;
G[a].push_back(b);
RG[b].push_back(a);
if (c == 2) {
G[b].push_back(a);
RG[a].push_back(b);
}
}
vector<pii> L, R;
for (int i = 1; i <= N; ++i) {
if (X[i] == 0) L.emplace_back(Y[i], i);
}
sort(L.begin(), L.end(), greater<pii>());
queue<int> Q;
for (auto [_, n] : L) {
V[n] = 1;
Q.push(n);
}
while (!Q.empty()) {
int cur = Q.front(); Q.pop();
for (int next : G[cur]) {
if (V[next]) continue;
V[next] = 1;
Q.push(next);
}
}
for (int i = 1; i <= N; ++i) {
if (X[i] == A && V[i]) R.emplace_back(Y[i], i);
}
sort(R.begin(), R.end(), greater<pii>());
memset(U, 0x3f, sizeof(U));
priority_queue<pii, vector<pii>, greater<pii>> PQ1;
for (int i = 0; i < R.size(); ++i) {
auto [_, n] = R[i];
PQ1.emplace(U[n] = i, n);
}
while (!PQ1.empty()) {
auto [cd, cur] = PQ1.top(); PQ1.pop();
for (int next : RG[cur]) {
if (U[next] <= U[cur]) continue;
PQ1.emplace(U[next] = U[cur], next);
}
}
memset(D, 0xff, sizeof(D));
priority_queue<pii> PQ2;
for (int i = 0; i < R.size(); ++i) {
auto [_, n] = R[i];
PQ2.emplace(D[n] = i, n);
}
while (!PQ2.empty()) {
auto [cd, cur] = PQ2.top(); PQ2.pop();
for (int next : RG[cur]) {
if (D[next] >= D[cur]) continue;
PQ2.emplace(D[next] = D[cur], next);
}
}
// for (int i = 1; i <= N; ++i) cout << U[i] << ' ';
// cout << '\n';
// for (int i = 1; i <= N; ++i) cout << D[i] << ' ';
// cout << '\n';
for (auto [_, n] : L) {
int ans = max(0, D[n] - U[n] + 1);
cout << ans << '\n';
}
return 0;
}
