#include<bits/stdc++.h>
using namespace std;
const int N=3e5+10;
const long long INF=1e18;
#define pli pair<long long,int>
struct edge{
	int to;
	long long w;
};
int n,m,k;
vector<edge>graph[10*N]; 
vector<edge>data[N];
int d[N];
bool vis[10*N];
long long dis[10*N];
long long v[N],w[N];
int main(){
//	freopen("robot2.in","r",stdin);
//	freopen("robot2.out","w",stdout);
	int c;
	cin>>c;
	cin>>n>>m>>k;
	for(int i=1;i<k;i++){
		cin>>v[i];
		v[i]+=v[i-1];
	}
	w[1]=0;
	for(int i=2;i<=k;i++){
		cin>>w[i];
		w[i]+=w[i-1];
	}
	for(int i=1;i<=n;i++){
		cin>>d[i];
		for(int j=1;j<min(d[i],k);j++){
			graph[i+j*n].push_back({i+(j+1)*n,v[j]-v[j-1]});
			graph[i+(j+1)*n].push_back({i+j*n,w[j+1]-w[j]});
		}
		for(int j=1;j<=d[i];j++){
			int y,z;
			cin>>y>>z;
			data[i].push_back({y,z});
		}
	}
	for(int i=1;i<=n;i++){
		int cnt=0;
		for(auto j:data[i]){
			cnt++;
			if(cnt>k) break;
			if(cnt<=d[j.to]){
				graph[i+cnt*n].push_back({j.to+cnt*n,j.w});
			}else{
				graph[i+cnt*n].push_back({j.to+cnt*d[j.to],j.w+w[cnt]-w[d[j.to]]});//之后还要移动 
				graph[i+cnt*n].push_back({j.to+0*n,j.w});//不能再动 
			}
		}
	}
	priority_queue<pli,vector<pli>,greater<pli>>q;
	q.push({0,n+1});
	for(int i=0;i<10*N;i++){
		dis[i]=INF;
	}
	dis[n+1]=0;
	while(!q.empty()){
		int u=q.top().second;q.pop();
		if(vis[u]) continue;
		if(u<=n) continue;
		vis[u]=1;
		for(auto e:graph[u]){
			int v=e.to,w=e.w;
			if(dis[v]>dis[u]+w){
				dis[v]=dis[u]+w;
				q.push({dis[v],v});
			}
		}
	}
	for(int i=1;i<=n;i++){
		long long ans=INF;
		for(int j=0;j<=d[i];j++){
			ans=min(ans,dis[i+j*n]);
		}
		if(ans==INF){
			cout<<"-1 ";
		}else{
			cout<<ans<<" ";
		}
	}
	return 0;
}