#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <bits/stdc++.h>
#include <atcoder/maxflow>
using namespace std;
using namespace atcoder;

const ll INF=1e18;

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n,m;
  cin>>n>>m;
  vector<ll> A(n),B(m);
  ll sum=0;
  rep(i,n) cin>>A[i];
  rep(i,m){
    cin>>B[i];
    sum+=B[i];
  }
  
  mf_graph<ll> graph(n+m+2);
  rep(i,n) graph.add_edge(n+m,i,A[i]);
  rep(i,m) graph.add_edge(i+n,n+m+1,B[i]);
  rep(i,m){
    int k;
    cin>>k;
    rep(j,k){
      int c;
      cin>>c;
      c--;
      graph.add_edge(c,i+n,INF);
    }
  }
  cout<<sum-graph.flow(n+m,n+m+1)<<endl;
  
  return 0;
}