#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,k[21],e[21],id[15],ans;
int t[15][15],d[15];
int p[15][1<<15];
bool flag;
int dp[15][1<<15];
int sta[25],cnt;
void chu()
{
    memset(t,-1,sizeof(t));
    memset(d,0,sizeof(d));
    memset(p,0,sizeof(p));
    memset(sta,0,sizeof(sta));
    memset(k,0,sizeof(k));
    memset(e,0,sizeof(e));
    memset(id,0,sizeof(id));
    memset(dp,0,sizeof(dp));
    cnt=0;
    ans=-1;
}
int main()
{
	freopen("shana.in","r",stdin);
	freopen("shana.out","w",stdout);
    while(scanf("%d",&n)&&n)
    {
        chu();
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&t[1][i],&d[i]);
            for(int j=2;t[1][i]-(j-1)*d[i]>=0&&j<=n;j++)
            {
            	t[j][i]=t[1][i]-(j-1)*d[i];
			}  
        }
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        {
            int tmp=0;
            scanf("%d%d",&k[i],&e[i]);
            for(int j=1;j<=k[i];j++)
            {
                scanf("%d",&id[j]);
                tmp|=1<<(id[j]-1);
            }
            if(p[0][tmp]&&p[0][tmp]<e[i])
            {
                for(int j=1;p[j][tmp]>0;j++)
                {
                	p[j][tmp]=(p[j][tmp]-p[0][tmp]+e[i]);
				}
                p[0][tmp]=e[i];
                continue;
            }
            else if(p[0][tmp]&&p[0][tmp]>=e[i]) continue;
            p[0][tmp]=e[i];
            cnt++;
            sta[cnt]=tmp;
            flag=0;
            for(int j=1;j<=n;j++)
            {
                int temp=0;
                for(int l=1;l<=k[i];l++)
                {
                    if(t[j][id[l]]<0)
                    {
                        p[j][tmp]=-1;
                        flag=1;
                        break;
                    }
                    temp+=t[j][id[l]];
                }
                if(flag)
                {
                    p[j][tmp]=-1;
                    continue;
                }
                else  p[j][tmp]=(temp+e[i]);
            }
        }
        for(int i=1;i<=n;i++)
        {
        	for(int j=0;j<(1<<n);j++)
        	{
        		for(int l=1;l<=cnt;l++)
        		{
        			if((!(j&sta[l]))&&p[i][sta[l]]!=-1)
                        dp[i][j|sta[l]]=max(dp[i-1][j]+p[i][sta[l]],dp[i][j|sta[l]]);
				}  
			}  
		} 
        for(int i=1;i<=n;i++)
        {
        	for(int j=0;j<(1<<n);j++)
        	{
        		ans=max(ans,dp[i][j]);
			}   
		} 
        printf("%d\n",ans);
    }
    return 0;
}