#include <bits/stdc++.h>
using namespace std;
#define N ((int)(1e4))
typedef long long ll;

int a[N], b[N];

int main()
{
    int n;
    scanf("%d",&n);
    for(int i = 1; i<=n; i++) scanf("%d",&a[i]);
    int m;
    scanf("%d",&m);
    for(int i = 1; i<=m; i++) scanf("%d",&b[i]);
    int mn = ((int)(2e9));
    for(int i = 1; i<=n; i++){
        int k;
        scanf("%d",&k);
        int tmp = ((int)(2e9));
        while(k--){
            int aa;
            scanf("%d",&aa);
            tmp = min(tmp,b[aa]);
        }

        if(tmp<((int)(2e9))){
            a[i] += tmp;
            mn = min(mn,a[i]);
        }
    }

    int x;
    scanf("%d",&x);
    //cout<<x<<endl;
    printf("%d\n",x/mn - 1);
    return 0;
}