#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <cmath> 
#include <climits>
#include <functional>
#include <iomanip>
#include <limits>
#include <cassert>
#include <random>
#include <complex>
#include <numeric>
#include <regex>
#include <list>
#include <ctime>
#include <chrono>
#include <array>
#include <cstring>

using namespace std;

#define ll long long
#define ull unsigned long long
#define ld  long double
typedef vector<long long> vll;

using LL = long long; using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>;
using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>;
using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>;
using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>;
using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>;
using MII = map<int,int>; using MLL = map<LL,LL>;
using SI = set<int>; using SL = set<LL>;
using MSI = multiset<int>; using MSL = multiset<LL>;
template<class T> using MAXPQ = priority_queue<T>;
template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >;

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
#define PI  3.14159265358979323846

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(e, v) for(auto &e : v)
#define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it)
#define ALL(v) v.begin(),v.end()

vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1};
int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1};

/*
memo
-uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy
-isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv(modpow必要)
nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10
-dijkstra,Floyd,bellmanford,sccd,topological,treediamiter
-compress1,compress2,rotate90

-co,ci,fo1,fo2,fo3,fo4
-bitsearch,binaryserach
-bfs(vis.assign忘れるな)
-SegTreedec,SegTreeLazydec
*/

struct Dinic{
    struct edge{
        long long to,cap,rev;
    };

    int N;
    vector<vector<edge>> G;
    vector<long long> level;
    vector<int> vis;
    Dinic(int n){
        N = n;
        G = vector<vector<edge>>(n);
        level = vector<long long>(n,-1);
        vis = vector<int>(n,0);
    }

    void addedge(int u, int v, long long cap){
        G[u].push_back(edge{v,cap,(long long)G[v].size()});
        G[v].push_back(edge{u,0,(long long)G[u].size()-1});
    }

    void bfs(int s){
        level=vector<long long>(N,-1);
        level[s] = 0;
        queue<int> q;
        q.push(s);
        while(q.size()){
            int p = q.front();
            q.pop();
            for(auto e : G[p]){
                if(level[e.to] < 0 and e.cap > 0){
                    q.push(e.to);
                    level[e.to] = level[p]+1;                    
                }
            }
        }
    }

    long long dfs(int p,int t,long long f){
        if(p==t) return f;
        vis[p]=1;
        for(edge &e : G[p]){
            if(level[e.to] > level[p] and e.cap > 0 and !vis[e.to]){
                long long d = dfs(e.to,t,min(e.cap,f));
                if(d > 0){
                    e.cap -= d;
                    G[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }

        return 0;
    }

    //sからtまでの最大流を求める.
    long long maxflow(int s, int t){
        long long inf = 1LL<<60;
        long long flow = 0;
        while(true){
            bfs(s);
            if(level[t]<0) break;
            vis = vector<int>(N,0);
            long long f;
            while((f = dfs(s,t,inf)) > 0){
                flow += f;
            }
        }

        return flow;
    }

};

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    ll N,M; cin >> N >> M;
    ll s = 0;
    VL a(N),b(M); for(ll i = 0; i < N; i++) cin >> a[i];
    for(ll i = 0; i < M; i++) cin >> b[i], s += b[i];

    Dinic f(N+2+M);
    VL cost(N,0);
    for(ll i = 0; i < M; i++){
        ll k; cin >> k;
        VL c(k);
        for(ll j = 0; j < k; j++){
            cin >> c[j];
            c[j]--;
        }

        f.addedge(N+2+i,N+1,b[i]);

        for(ll j = 0; j < k; j++) f.addedge(c[j],N+2+i,INF);
    }

    for(ll i = 0; i < N; i++){
        f.addedge(N,i,a[i]);
    }

    cout << s-f.maxflow(N,N+1) << endl;


    
}