#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define inf (INT_MAX/2)
#define NN 300
#define BIG_VALUE 10000

struct E { int v,rev,cap,cost; };
vector<E> es[NN];
int nn,used[NN],dist[NN],pot[NN];
int prev[NN],prev_eid[NN];
int added[NN][NN];

void add_edge(int a, int b, int cap, int cost){
  es[a].push_back((E){b,es[b].size()+(a==b),cap,cost});
  es[b].push_back((E){a,es[a].size()-1,0,-cost});
}

pair<int,int> mcmf(int s, int t){
  pair<int,int> res;
  memset(pot,0,sizeof(pot));
  while (1){
    memset(used,0,sizeof(used));
    memset(prev,-1,sizeof(prev));
    for (int i=0;i<nn;++i) dist[i]=inf;
    dist[s]=0;

    for (int k=0;k<nn;++k) {
      int best=-1;
      for (int i=0;i<nn;++i)
        if (!used[i] && (best==-1 || dist[i]<dist[best])) 
          best=i;
      used[best]=1;
      if (dist[best]==inf) break;

      for (int i=0;i<es[best].size();++i) {
        E& e=es[best][i];
        if (e.cap==0) continue;
        int ncost=dist[best]+e.cost-pot[e.v]+pot[best];
        if (dist[e.v]>ncost){
          dist[e.v]=ncost;
          prev[e.v]=best;
          prev_eid[e.v]=i;
        }
      }
    }
 
    if (dist[t]==inf) break;
    for (int i=0;i<nn;++i) dist[i]+=pot[i],pot[i]=dist[i];
 
    int tau=inf;
    for (int v=t;v!=s;v=prev[v]) tau=min(tau,es[prev[v]][prev_eid[v]].cap);
      
    res.first+=tau;
    for (int v=t;v!=s;v=prev[v]) {
      E& e=es[prev[v]][prev_eid[v]];
      res.second+=e.cost*tau;
      e.cap-=tau;
      es[v][e.rev].cap+=tau;
    } 
  }
  return res;
}

int main() {
  int n0,n1,m,l;
  while(cin>>n0>>n1,n0|n1) {
    map<string,int> items;
    nn=2+n0+n1;
    for (int i=0;i<nn;++i) es[i].clear();

    for (int i=0;i<n0;++i) {
      int v; cin>>v;
      add_edge(0,2+i,v,0);
    }
    for (int i=0;i<n1;++i) {
      int v; cin>>v;
      add_edge(2+n0+i,1,v,0);
    }
    cin>>m;
    for (int i=0;i<m;++i) {
      string name; 
      int cost;
      cin>>name>>cost;
      items[name]=cost;
    }

    memset(added,0,sizeof(added));
    cin>>l;
    for (int i=0;i<l;++i) {
      int i0,i1,num; 
      cin>>i0>>i1>>num;
      --i0,--i1;
      int cost=0;
      for (int j=0;j<num;++j) {
	string name; cin>>name;
	cost+=items[name];
      }
      add_edge(2+i0,2+n0+i1,NN,BIG_VALUE-cost);
      added[i0][i1]=1;
    }
    for (int i=0;i<n0;++i)
      for (int j=0;j<n1;++j)
	if (!added[i][j])
	  add_edge(2+i,2+n0+j,NN,BIG_VALUE);

    pair<int,int> r=mcmf(0,1);
    cout<<BIG_VALUE*r.first-r.second<<endl;
  }
}