#include <bits/stdc++.h>
using namespace std;

#define int long long
#define N 1010
#define M 200010
int head[N],nxt[M],e[M];
int val[M];
int sy[M];
int tot = 0;
void addedge(int x,int y,int z,int k) {
	nxt[++tot] = head[x];
	head[x] = tot;
	e[tot] = y;
	val[tot] = z;
	sy[tot] = k;
}

int a,b;
int c,d;
int dismax;

int T;
int pf[N];

int n;
#define PII pair<int,int>
PII pos[N];
vector<PII> lb[N];

int dis[N][N];

int ad[N]; // 额外距离
#define PIP pair<int,PII>
priority_queue<PIP,vector<PIP>,greater<>> q;
bitset<N> v[N];
void Dijkstra() {
	while(!q.empty()) {
		PIP tmp = q.top();
		q.pop();
		int x = tmp.second.first;
		int di = tmp.second.second;
		if(v[x][di]) continue;
		v[x][di] = 1;
		for(int i = head[x];i;i = nxt[i]) {
			int y = e[i];
			// cout << x << " " << y << " " << val[i] << " " << di << " " << ad[y] << '\n';
			if(val[i] + di + ad[y] <= dismax) {
				// cout <<  x << " " << y << '\n';
				if(dis[y][di + val[i]] > dis[x][di] + val[i] * pf[sy[i]]) {
					// cout << x << " " << y << '\n';
					dis[y][di + val[i]] = dis[x][di] + val[i] * pf[sy[i]];
					q.push({dis[y][di + val[i]],{y,di + val[i]}});
				}
			}
		}
	}
}


signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	cin >> a >> b >> c >> d;
	cin >> dismax >> pf[0];
	cin >> T;
	for(int i = 1;i <= T; ++i) {
		cin >> pf[i];
	}
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> pos[i].first >> pos[i].second;
		int t;
		cin >> t;
		for(int j = 1; j <= t; ++j) {
			PII tmp;
			cin >> tmp.first >> tmp.second;
			++tmp.first; // 不是，怎么从 0 起
			lb[i].emplace_back(tmp);
		}
	}
	for(int i = 1; i <= n; ++i) {
		// (pos[i].first - c) * (pos[i].first - c) + (pos[i].second - d) * (pos[i].second - d)
		ad[i] = ceil(sqrt((pos[i].first - c) * (pos[i].first - c) + (pos[i].second - d) * (pos[i].second - d)));
		for(auto tmp : lb[i]) {
			int x = tmp.first;
			int y = tmp.second;
			// (pos[i].first - pos[x].first) * (pos[i].first - pos[x].first) + (pos[i].second - pos[x].second) * (pos[i].second - pos[x].second)
			int dis = ceil(sqrt((pos[i].first - pos[x].first) * (pos[i].first - pos[x].first) + (pos[i].second - pos[x].second) * (pos[i].second - pos[x].second)));
			addedge(i,x,dis,y);
			addedge(x,i,dis,y);
			// cout << i << " " << x << '\n';
		}
	}
	memset(dis,0x3f,sizeof(dis));
	for(int i = 1; i <= n; ++i) {
		// (pos[i].first - a) * (pos[i].first - a) + (pos[i].second - b) * (pos[i].second - b)
		int di = ceil(sqrt((pos[i].first - a) * (pos[i].first - a) + (pos[i].second - b) * (pos[i].second - b)));
		dis[i][di] = di * pf[0];
		q.push({dis[i][di],{i,di}});
	}
	int ans = 0x3f3f3f3f3f3f3f3f;
	Dijkstra();
	if(sqrt((a - c) * (a - c) + (b - d) * (b - d)) > dismax) {
		cout << -1;
		return 0;
	}
	ans = ceil(sqrt((a - c) * (a - c) + (b - d) * (b - d))) * pf[0];
	for(int i = 1; i <= n; ++i) {
		for(int j = 0;j + ad[i] <= dismax; ++j) {
			ans = min(ans,dis[i][j] + pf[0] * ad[i]);
		} 
	}
	cout << ans << '\n';
}
/*
1 1
10 2
12
100
2
10
50
3
2 3 2 1 1 2 2
5 5 1 2 1
9 3 0
*/