#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define pb eb
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define all2(i,j,v) for(auto& [i,j] : v)
template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

// cin.tie(nullptr);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);

#include <atcoder/maxflow>
using namespace atcoder;

void solve(){
  ll n,m;
  cin >> n >> m;
  mf_graph<ll> g(n + m + 2);
  ll ans = 0;
  rep(i,n){
    ll a;
    cin >> a;
    g.add_edge(i,n+1,a);
    g.add_edge(n, i, 0);
    // ans += a;
  }
  V<ll> b(m);
  rep(i,m) cin >> b[i];
  rep(i,m){
    ans += b[i];
    g.add_edge(n, n+2+i, b[i]);
    g.add_edge(n+2+i, n+1, 0);
    ll k;
    cin >> k;
    rep(j, k){
      ll a;
      cin >> a;
      g.add_edge(n+2+i, a-1, INF);
    }
  }
  
  ll p = g.flow(n, n+1);
  cout << ans-p << endl;
  
  
}





int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t=1;
  // cin >> t;
  rep(i,t) solve();
}