#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<sstream>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 using namespace std;

 typedef long long ll;

 typedef pair<int,int> pll;

 const int INF = 0x3f3f3f3f;

 const int maxn = 1e4 + ;

 int n, m;

 int v;

 struct node

 {

     int code, st, num, price;

 }a[maxn];

 map<int,int> ID;

 int d[maxn];

 int main()

 {

     //freopen("in.txt","r",stdin);

     while(~scanf("%d",&n))

     {

         v=;

         ID.clear();

         for(int i=;i<n;i++)

         {

             scanf("%d%d%d",&a[i].code,&a[i].num,&a[i].price);

             a[i].st=pow(6.0,(double)i);

             v+=a[i].st*a[i].num;

             ID[a[i].code]=i;

         }

         scanf("%d",&m);

         for(int i=;i<m;i++)

         {

             int t;

             scanf("%d",&t);

             a[i+n].st=;

             while(t--)

             {

                 int code, num;

                 scanf("%d%d",&code,&num);

                 if(ID.find(code)==ID.end())  continue;

                 a[i+n].st+=a[ID[code]].st*num;

             }

             scanf("%d",&a[i+n].price);

         }

         for(int i=;i<=v;i++)

             d[i]=INF;

         d[]=;

         for(int i=;i<n+m;i++)

         {

             for(int j=a[i].st;j<=v;j++)

             {

                 d[j]=min(d[j],d[j-a[i].st]+a[i].price);

             }

         }

         printf("%d\n",d[v]);

     }

     return ;

 }