#include<bits/stdc++.h>
using namespace std;
#define ll long long
inline int read() {
    int x = 0,f=1;
    char c = getchar();
    for (; !isdigit(c); c = getchar())if(c=='-')f=-f;
    for (; isdigit(c); c = getchar()) x= x * 10 + (c ^ 48);
    return x*f;
}
const int N=1005;
const int M=105;
int a[N][N];
int c[N][N];
int C[N];
int f[M][N];
int bx,by,ex,ey;
int x[N],y[N];
int len[N];
int dis(int xa,int ya,int xb,int yb)
{
    return (ceil(sqrt((xa-xb)*(xa-xb)+(ya-yb)*(ya-yb))));
}
int main()
{
    bx=read(),by=read();
    ex=read(),ey=read();
    int m=read();
    C[0]=read();
    int t=read();
    for(int i=1;i<=t;i++){
        C[i]=read();
    }
    int n=read();
    for(int i=1;i<=n;i++){
        x[i]=read(),y[i]=read();
        int k=read();
        for(int j=1;j<=k;j++){
            int x,mx;
            x=read()+1;mx=read();
            a[i][x]=1;
            c[i][x]=C[mx];
            c[x][i]=C[mx];
            a[x][i]=1;
        }
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(a[i][j]==1)a[i][j]=dis(x[i],y[i],x[j],y[j]);
            else a[i][j]=m+1;
    memset(f,127/3,sizeof(f));
    for(int i=1;i<=n;i++){
        int l=dis(bx,by,x[i],y[i]);
        f[l][i]=C[0]*l;
    }
    int l=dis(bx,by,ex,ey);
    if(l<=m)f[l][n+1]=C[0]*l;
    for(int i=1;i<=n;i++)
        len[i]=dis(x[i],y[i],ex,ey);
    int maxm=C[0]*m;
    for(int B=0;B<=m;B++){
        for(int i=1;i<=n;i++){
            if(B+len[i]>m)continue;
            if(f[B][i]>maxm)continue;
            f[B+len[i]][n+1]=min(f[B+len[i]][n+1],f[B][i]+C[0]*len[i]);
            for(int j=1;j<=n;j++)
                if(B+a[i][j]<=m){
                    f[B+a[i][j]][j]=min(f[B][i]+c[i][j]*a[i][j],f[B+a[i][j]][j]);
                }
        }
    }
    int ans=10005;
    for(int i=0;i<=m;i++){
        ans=min(f[i][n+1],ans);
    }
    if(ans==10005)puts("-1");
    else printf("%d\n",ans);
    return 0;
}