#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

const long long INF = 1001001001001001;

int main(){
	int n, m;
	cin >> n >> m;
	vector<long long> a(n);
	cin >> a;
	vector<long long> b(m);
	cin >> b;
	mf_graph<long long> graph(n + m + 2);
	int sv = n + m;
	int tv = n + m + 1;
	rep(i, n){
		graph.add_edge(sv, i, a[i]);
	}
	long long ans = 0;
	rep(i, m){
		int dummy = n + i;
		ans += b[i];
		graph.add_edge(dummy, tv, b[i]);
		int k;
		cin >> k;
		rep(j, k){
			int x;
			cin >> x;
			x--;
			graph.add_edge(x, dummy, INF);
		}
	}
	ans -= graph.flow(sv, tv);
	cout << ans << "\n";
	return 0;
}