#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define int long long

const int inf = 1e18;
namespace LICHAO {
	const int LCB = 7e6;
	int m[LCB],b[LCB],q[LCB];
	int l[LCB],r[LCB],npos = 1;
	void reset() {npos = 1;}
	int create() {
		b[npos] = inf;
		l[npos] = r[npos] = 0;
		return npos++;
	}
	void insert(int i, int cm, int cb, int id, int lo = 0, int hi = 2e9) {
		if (lo+1==hi) {
			if (cm*lo+cb < m[i]*lo+b[i]) {m[i] = cm, b[i] = cb, q[i] = id;}
			return;
		}
		int mid = (lo+hi)/2;
		if (cm*mid+cb < m[i]*mid+b[i]) {swap(cm,m[i]); swap(cb,b[i]); swap(id,q[i]);}
		if (cm==0 && cb==inf) return;
		if (cm*lo+cb < m[i]*lo+b[i]) {
			if (!l[i]) l[i] = create();
			insert(l[i],cm,cb,id,lo,mid);
		} else {
			if (!r[i]) r[i] = create();
			insert(r[i],cm,cb,id,mid,hi);
		}
	}
	array<int,2> query(int i, int x, int lo = 0, int hi = 2e9) {
		if (lo+1 == hi) {return {m[i]*x+b[i],q[i]};}
		int mid = (lo+hi)/2;
		array<int,2> res = {m[i]*x+b[i],q[i]};
		if (x < mid) {if (l[i]) res = min(res, query(l[i],x,lo,mid));}
		else {if (r[i]) res = min(res, query(r[i],x,mid,hi));}
		return res;
	}
}

const int mxn = 4e5+5;

int n,k,a[mxn],b[mxn];
vector<int> x[mxn],w[mxn];
vector<array<int,3>> line[mxn];
vector<int> pos[mxn];
int fp[mxn],lcrt[mxn];
priority_queue<array<int,3>,vector<array<int,3>>,greater<array<int,3>>> dij;
int dist[mxn]; vector<int> dt[mxn];

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	cin>>n>>k;
	for (int i=0; i<k; i++) cin>>a[i];
	for (int i=0; i<k; i++) cin>>b[i];
	for (int i=0; i<k; i++) {
		int p; cin>>p;
		x[i].resize(p);
		w[i].resize(p-1);
		cin>>x[i][0]; --x[i][0];
		for (int j=1; j<p; j++) {
			cin>>w[i][j-1]>>x[i][j];
			--x[i][j];
		}
		pos[i].resize(p);
		dt[i] = vector<int>(p,inf);
	}
	for (int i=0; i<k; i++) {
		for (int j=0; j<sz(x[i]); j++) {
			line[x[i][j]].push_back({a[i],i,j});
		}
	}
	for (int i=0; i<n; i++) {
		sort(all(line[i]));
		for (int j=0; j<sz(line[i]); j++) {
			pos[line[i][j][1]][line[i][j][2]] = j;
		}
	}
	for (int i=0; i<n; i++)
		lcrt[i] = LICHAO::create();
	
	fill(dist,dist+n,inf);	
	for (auto [bv,li,lp] : line[0]) {
		dij.push({0,li,lp});
	}
	while (sz(dij)) {
		auto [d,li,lp] = dij.top(); dij.pop();
		if (dt[li][lp] <= d) continue;
//		cout<<d<<" "<<li<<" "<<lp<<endl;
		dt[li][lp] = d;
		//add line to hull
		int xp = x[li][lp];
		dist[xp] = min(dist[xp],d);
		LICHAO::insert(lcrt[xp],b[li],d,0);
		//go to next line in subway
		if (lp < sz(w[li])) {
			dij.push({d+w[li][lp], li, lp+1});
		}
		//go to next line at station
		while (fp[xp] < sz(line[xp])) {
			auto [av, lj, jp] = line[xp][fp[xp]];
			if (dt[lj][jp] < inf) {
				fp[xp]++;
			} else break;
		}
		if (fp[xp] == sz(line[xp])) continue;
		auto [av,lj,jp] = line[xp][fp[xp]];
		auto [dt,uk] = LICHAO::query(lcrt[xp],av);
		dij.push({dt,lj,jp});
		fp[xp]++;
	}
	for (int i=1; i<n; i++)
		cout<<dist[i]<<" ";
	
	
}