[CEOI2008] order

#include<bits/stdc++.h>
#define ll long long
#define pb push_back
const int maxn=3005;
using namespace std;
const int inf=1<<30;
vector<int> g[maxn];
struct lines{
    int to,flow,cap;
}l[maxn*1000];
int S,T,t=-1,d[maxn],cur[maxn];
bool v[maxn];
    
inline void add(int from,int to,int cap){
    l[++t]=(lines){to,0,cap},g[from].pb(t);
    l[++t]=(lines){from,0,0},g[to].pb(t);
}
    
inline bool BFS(){
    memset(v,0,sizeof(v));
    queue<int> q;
    q.push(S),v[S]=1,d[S]=0;
    int x; lines e;
         
    while(!q.empty()){
        x=q.front(),q.pop();
        for(int i=g[x].size()-1;i>=0;i--){
            e=l[g[x][i]];
            if(e.flow<e.cap&&!v[e.to]){
                v[e.to]=1,d[e.to]=d[x]+1;
                q.push(e.to);
            }
        }
    }
         
    return v[T];
}
     
int dfs(int x,int A){
    if(!A||x==T) return A;
    int flow=0,f,sz=g[x].size();
    for(int &i=cur[x];i<sz;i++){
        lines &e=l[g[x][i]];
        if(d[e.to]==d[x]+1&&(f=dfs(e.to,min(A,e.cap-e.flow)))){
            A-=f,flow+=f;
            e.flow+=f,l[g[x][i]^1].flow-=f;
            if(!A) break;
        }
    }
         
    return flow;
}
     
inline int max_flow(){
    int an=0;
    while(BFS()){
        memset(cur,0,sizeof(cur));
        an+=dfs(S,inf);
    }
    return an;
}
int N,M,ans=0,now,num,K;
int main(){
	scanf("%d%d",&N,&M),S=0,T=N+M+1;
	for(int i=1;i<=N;i++){
		scanf("%d",&now),ans+=now,add(S,i,now);
		scanf("%d",&K);
		while(K--){
			scanf("%d%d",&num,&now);
			add(i,num+N,now);
		}
	}
	for(int i=1;i<=M;i++) scanf("%d",&now),add(i+N,T,now);
	printf("%d\n",ans-max_flow());
	return 0;
}