#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,m,W,H,nxt[N],to[N],head[N],ecnt,idx;
int dis[N];
struct city {
	int z[2],id;
	bool operator<(const city &u) const{return z[idx]<u.z[idx];}
}a[N];
char buf[1<<23],*p1=buf,*p2=buf,obuf[1<<23],*O=obuf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline int read() {
	int x=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
	while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
	return x*f;
}
struct jump {
	int p,t,l[2],r[2];
}J[N];
void add_edge(int u,int v) {nxt[++ecnt]=head[u];to[ecnt]=v;head[u]=ecnt;}
struct node {int mid,l[2],r[2];}T[N];
int ls[N],rs[N];
struct pq {
	int p,w;
	bool operator<(const pq &u) const{return w>u.w;}
};
priority_queue<pq> Q;
void Update(int y,int z) {
	if(dis[y]>z) {Q.push((pq){y,dis[y]=z});}
}
struct kd_tree {
	int nd;
	void Build(int x,int l,int r) {
		int _idx(idx);idx^=1;int dx(idx);
		int mid=(l+r)>>1;
		nth_element(a+l,a+mid,a+r+1);
		T[x].mid=mid;
		T[x].l[0]=T[x].r[0]=a[mid].z[0];T[x].l[1]=T[x].r[1]=a[mid].z[1];
		if(l!=mid) {
			ls[x]=++nd;
			Build(nd,l,mid-1);idx=dx;int L=ls[x];
			T[x].l[0]=min(T[x].l[0],T[L].l[0]);T[x].l[1]=min(T[x].l[1],T[L].l[1]);
			T[x].r[0]=max(T[x].r[0],T[L].r[0]);T[x].r[1]=max(T[x].r[1],T[L].r[1]);
		}
		if(mid!=r) {
			rs[x]=++nd;
			Build(nd,mid+1,r);int R=rs[x];
			T[x].l[0]=min(T[x].l[0],T[R].l[0]);T[x].l[1]=min(T[x].l[1],T[R].l[1]);
			T[x].r[0]=max(T[x].r[0],T[R].r[0]);T[x].r[1]=max(T[x].r[1],T[R].r[1]);
		}
	} 
	void Mk_tree() {
		nd=n+1;
		T[nd].l[0]=1e9,T[nd].r[0]=0;T[nd].l[1]=1e9;T[nd].r[1]=0;
		for(int i=1;i<=n;i++) {
			T[nd].l[0]=min(T[nd].l[0],a[i].z[0]);T[nd].r[0]=max(T[nd].r[0],a[i].z[0]);
			T[nd].l[1]=min(T[nd].l[1],a[i].z[1]);T[nd].r[1]=max(T[nd].r[1],a[i].z[1]);
		}
		Build(nd,1,n);
	}
	void Go(int x,int id,int w) {			//id(jump)
		idx^=1;int dx(idx);
		if(dis[x]<=w) return;
		if(T[x].l[0]>=J[id].l[0]&&T[x].l[1]>=J[id].l[1]&&T[x].r[0]<=J[id].r[0]&&T[x].r[1]<=J[id].r[1]) {Update(x,w);return;}
		int mid=T[x].mid,L(ls[x]),R(rs[x]),pos(a[mid].id);
		if(J[id].l[0]<=a[mid].z[0]&&J[id].l[1]<=a[mid].z[1]&&J[id].r[0]>=a[mid].z[0]&&J[id].r[1]>=a[mid].z[1]) {Update(pos,w);}
		if(L&&J[id].l[dx]<=T[L].r[dx])Go(L,id,w),idx=dx;
		if(R&&J[id].r[dx]>=T[R].l[dx])Go(R,id,w);
	}
}KD;
void DJ(int s) {
	memset(dis,0x3f,sizeof(dis));
	Q.push((pq){s,0});dis[s]=0;
	while(!Q.empty()) {
		if(dis[Q.top().p]<Q.top().w){Q.pop();continue;}			//There often be many same node in it(pop just leave the smallest one)
		int u=Q.top().p;Q.pop();
		if(u>n) {
			if(ls[u]) {Update(ls[u],dis[u]);}
			if(rs[u]) {Update(rs[u],dis[u]);}
			Update(a[T[u].mid].id,dis[u]);
		}
		else {
			for(int i=head[u];i;i=nxt[i]) {
				int v=to[i];
				idx=0;KD.Go(n+1,v,dis[u]+J[v].t);
			}
		}
	}
}
int main() {
//	freopen("data.in","r",stdin);
//	freopen("ans2.out","w",stdout);
//	scanf("%d%d%d%d",&n,&m,&W,&H);
	n=read(),m=read(),W=read(),H=read();
//	printf("!%d\n",n);
	for(int i=1;i<=n;i++) {a[i].z[0]=read();a[i].z[1]=read();a[i].id=i;}
	KD.Mk_tree();
	for(int i=1;i<=m;i++) {
		J[i].p=read();J[i].t=read();J[i].l[0]=read();J[i].r[0]=read();J[i].l[1]=read();J[i].r[1]=read();
//		scanf("%d%d%d%d%d%d",&J[i].p,&J[i].t,&J[i].l[0],&J[i].r[0],&J[i].l[1],&J[i].r[1]);
		add_edge(J[i].p,i);
	}
	DJ(1);
	for(int i=2;i<=n;i++) printf("%d\n",dis[i]);
	return 0;
}