#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#define MAX(a,b) ((a)>=(b)?(a):(b))
#define MIN(a,b) ((a)<=(b)?(a):(b))
#define long long LL
#define OO 0x0fffffff
using namespace std;
const int N = 128;
int f[66666];
int cost[N],value[N];
int mapp[1024];

bool cmp(int a,int b){
    for(int i=0;i<5;i++){
        int tb = b%10;
        if( tb > 5 ) return false;
        if((a%10)>tb) return false;
        a/=10; b/=10;
    }
    return true;
}

int main(){
    int m,n,t,code,cnt,goal;
    goal = 0;
    cin>>m;
    for(int i=0;i<m;i++){
        cin>>code>>cnt>>cost[i];
        mapp[code] = i;
        value[i] = pow(10,i);
        goal += cnt*value[i];
    }
    cin>>n; n += m;
    for(int i=m;i<n;i++){
        value[i] = 0;
        cin>>t;
        while(t--){
            cin>>code>>cnt;
            value[i]+=(int)pow(10,mapp[code])*cnt;
        }
        cin>>cost[i];
    }

    for(int i=1;i<goal+8;i++) f[i]=OO;
    f[0]=0;
    for(int i=0;i<n;i++){
        for(int v=value[i];v<=goal;v++){
            if(cmp(value[i],v)){
                f[v] = MIN(f[v],f[v-value[i]]+cost[i]);
            }
        }
    }
    printf("%d\n",f[goal]);
    return 0;
}