#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ls p << 1
#define rs p << 1 | 1
using namespace std;

typedef pair<int, int> PII;
typedef set<PII>::iterator SIT;

const int N = 7e4 + 5;

int n, m, w, h, X[N], Y[N], d[N];

struct Ed{
	int t, L, R, D, U;
	bool operator < (const Ed &b) const {
		return t > b.t;
	}
};

vector<Ed> e[N];

priority_queue<Ed> q;

bool vis[N];

void inline push(int i, int dis) {
	vis[i] = 1, d[i] = dis;
	for (int j = 0; j < e[i].size(); j++) {
		Ed v = e[i][j];
		q.push((Ed) { dis + v.t, v.L, v.R, v.D, v.U });
	}
}

set<PII> t[N << 2];

void build(int p, int l, int r, vector<int> &a) {
	for (int i = 0; i < a.size(); i++)
		t[p].insert(mp(Y[a[i]], a[i]));
	if (l == r) return;
	int mid = (l + r) >> 1;
	vector<int> u, v;
	for (int i = 0; i < a.size(); i++) {
		if (X[a[i]] <= mid) u.pb(a[i]);
		else v.pb(a[i]);
	}
	build(ls, l, mid, u);
	build(rs, mid + 1, r, v);
}

void inline work(int p, int w, int L, int R) {
	SIT it = t[p].lower_bound(mp(L, 0));
	while (it != t[p].end() && it -> fi <= R) {
		if (!vis[it -> se]) push(it -> se, w);
		SIT jt = it; jt++;
		t[p].erase(it); it = jt;
	}
}

void change(int p, int l, int r, int x, int y, int t, int D, int U) {
	if (x <= l && r <= y) {
		work(p, t, D, U);
		return;
	}
	int mid = (l + r) >> 1;
	if (x <= mid) change(ls, l, mid, x, y, t, D, U);
	if (mid < y) change(rs, mid + 1, r, x, y, t, D, U);
}

int main() {
	scanf("%d%d%d%d", &n, &m, &w, &h);
	vector<int> s;
	for (int i = 1; i <= n; i++) scanf("%d%d", X + i, Y + i), s.pb(i);
	while (m--) {
		int p, t, l, r, d, u; scanf("%d%d%d%d%d%d", &p, &t, &l, &r, &d, &u);
		e[p].pb((Ed) { t, l, r, d, u} );
	}
	build(1, 1, w, s);
	push(1, 0);
	while (!q.empty()) {
		Ed u = q.top(); q.pop();
		change(1, 1, w, u.L, u.R, u.t, u.D, u.U);
	}
	for (int i = 2; i <= n; i++) printf("%d\n", d[i]);
	return 0;
}