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

long long inf = 2e18;
struct edge{ int to; long long cap; int rev; bool isrev;};
class Dinic{
public:
    int siz = 0;
    vector<vector<edge>> Graph;
    vector<int> searched,dist;
    vector<bool> visited;
 
    void make(int N){
        siz = N;
        Graph.resize(N); visited.resize(N);
        dist.resize(N,-1);
    }
 
    void addedge(int u, int v, long long c){
        int gv = Graph.at(v).size(), gu = Graph.at(u).size();
        Graph.at(u).push_back({v,c,gv,false});
        Graph.at(v).push_back({u,0,gu,true});
    }
 
    void bfs(int s, int t){
        queue<int> Q; Q.push(s);
        dist.at(s) = 0;
        while(Q.size()){
            int pos = Q.front(); Q.pop();
            for(auto &[to,c,r,ign] : Graph.at(pos)){
                if(c > 0 && dist.at(to) == -1){
                    dist.at(to) = dist.at(pos)+1;
                    if(to != t) Q.push(to);
                }
            }
        }
    }
 
    long long dfs(int pos, int start, long long f){
        if(pos == start) return f;
        visited.at(pos) = true;
 
        long long flow = 0;
        for(auto &[t,c,r,ign] : Graph.at(pos)){
            long long &revc = Graph.at(t).at(r).cap;
            if(visited.at(t) || revc == 0 || f-flow == 0 || dist.at(pos) <= dist.at(t)) continue;
            long long now = dfs(t,start,min(revc,f-flow));
            c += now; revc -= now;
 
            flow += now;
        }
        return flow;
    }
 
    long long maxflow(int s, int t){
        long long ret = 0;
        while(true){
            visited.assign(siz,false);
            dist.assign(siz,-1);
            bfs(s,t);
            if(dist.at(t) == -1) break;
            ret += dfs(t,s,inf);
        }
        return ret;
    }
 
    vector<pair<int,int>> mincost(int s){
        //maxflowの後の復元
        vector<int> distS(siz,-1);
        distS.at(s) = 1;
        queue<int> Q; Q.push(s);
        while(Q.size()){
            int pos = Q.front(); Q.pop();
            for(auto &[to,c,r,ign] : Graph.at(pos)){
                if(c == 0 || distS.at(to) != -1) continue;
                distS.at(to) = 1; Q.push(to);
            }
        }
 
        vector<pair<int,int>> ret;
        for(int i=0; i<siz; i++){
            for(auto &[to,c,r,isr] : Graph.at(i)){
                if(to < i || isr) continue;
                if(distS.at(i) != distS.at(to)) ret.push_back({i,to});
            }
        }
        return ret;
    }
};

int main() {
    int N,M; cin >> N >> M;
    Dinic Z; Z.make(N+M+2);
    int s = N+M,t = N+M+1;

    long long answer = 0;
    for(int i=0; i<N; i++){
        int a; cin >> a;
        Z.addedge(s,i,a);
    }
    for(int i=0; i<M; i++){
        int b; cin >> b;
        answer += b;
        Z.addedge(N+i,t,b);
    }
    for(int i=0; i<M; i++){
        int K; cin >> K;
        for(int k=0; k<K; k++){
            int c; cin >> c; c--;
            Z.addedge(c,N+i,(long long)1e18);

        }
    }
    cout << answer-Z.maxflow(s,t) << endl;
}