codeforces103E Buying Sets

//It is made by ljh2000
//有志者，事竟成，破釜沉舟，百二秦关终属楚；苦心人，天不负，卧薪尝胆，三千越甲可吞吴。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <ctime>
using namespace std;
typedef long long LL;
const int MAXN = 15001;
const int inf = (1<<29);
int n,P[MAXN],Tim,match[MAXN],vis[MAXN];
vector<int>medi[MAXN];
LL ans;

inline int getint(){
    int w=0,q=0; char c=getchar(); while((c<‘0‘||c>‘9‘) && c!=‘-‘) c=getchar();
    if(c==‘-‘) q=1,c=getchar(); while (c>=‘0‘&&c<=‘9‘) w=w*10+c-‘0‘,c=getchar(); return q?-w:w;
}

namespace network{
	const int MAXM = 1000011;
	int ecnt,first[MAXN],S,T,dui[MAXN],deep[MAXN];
	queue<int>q;
	struct edge{ int to,f,next; }e[MAXM];
	inline void Init(){ ecnt=1; S=n+1; T=S+1; }
	inline void link(int x,int y,int z){
		e[++ecnt].next=first[x]; first[x]=ecnt; e[ecnt].to=y; e[ecnt].f=z;
		e[++ecnt].next=first[y]; first[y]=ecnt; e[ecnt].to=x; e[ecnt].f=0;
	}

	inline bool bfs(){
		for(int i=1;i<=T;i++) deep[i]=-1; deep[S]=0; q.push(S); int u;
		while(!q.empty()){
			u=q.front(); q.pop();
			for(int i=first[u];i;i=e[i].next) {
				if(e[i].f==0) continue;
				int v=e[i].to; if(deep[v]!=-1) continue;
				deep[v]=deep[u]+1; q.push(v);
			}
		}
		return (deep[T]!=-1);
	}

	inline int dinic(int x,int remain){
		if(x==T || remain==0) return remain;
		int f,flow=0;
		for(int i=first[x];i;i=e[i].next) {
			if(e[i].f==0) continue;
			int v=e[i].to; if(deep[v]!=deep[x]+1) continue;
			f=dinic(v,min(remain,e[i].f));
			if(f==0) deep[v]=-1;
			else {
				flow+=f; remain-=f;
				e[i].f-=f; e[i^1].f+=f;
				if(remain==0) return flow;
			}
		}
		return flow;
	}
}

inline bool dfs(int x){
	if(vis[x]==Tim/*!!!*/) return false;//!!!
	vis[x]=Tim;
	for(int i=0,ss=medi[x].size();i<ss;i++) {
		int v=medi[x][i]; if(vis[v]==Tim) continue;
		if(!match[v] || dfs(match[v])) {
			match[v]=x;
			return true;
		}
	}
	return false;
}

inline void work(){
	using namespace network;
	n=getint(); Init(); int x,y;
	for(int i=1;i<=n;i++) { x=getint(); while(x--) { y=getint(); medi[i].push_back(y+n); } }
	for(int i=1;i<=n;i++) Tim++,dfs(i);
	for(int i=1;i<=n;i++) P[i]=getint();
	for(int i=1;i<=n;i++) for(int j=0,ss=medi[i].size();j<ss;j++) link(i,match[ medi[i][j] ],inf);
	for(int i=1;i<=n;i++) {
		P[i]=-P[i];
		if(P[i]>0) link(S,i,P[i]),ans+=P[i];
		else link(i,T,-P[i]);
	}

	while(bfs())
		ans-=dinic(S,inf);

	ans=-ans;
	printf("%I64d",ans);
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("103.in","r",stdin);
	freopen("103.out","w",stdout);
#endif
    work();
    return 0;
}
//有志者，事竟成，破釜沉舟，百二秦关终属楚；苦心人，天不负，卧薪尝胆，三千越甲可吞吴。