关于网络流，玄关

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int,int>
#define il inline
#define re register
#define fs first
#define sc second
using namespace std;
il int read()
{
	re int x=0;
	re int ff=1;
	re char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')
			ff=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=x*10+c-'0';
		c=getchar();
	}
	return x*ff;
}
const int N=3e3+6;
struct edge{
	int v,next,f;
};
edge e[N*N];
int n,sum,m,k,head[N],cur[N],dep[N];
il void add(re int u,re int v,re int w)
{
	e[k]={v,head[u],w},head[u]=k++;
	e[k]={u,head[v],0},head[v]=k++;
	(w!=1e12?sum+=w:0);return;
}
il bool bfs()
{
	memcpy(cur,head,sizeof(cur));
	memset(dep,0,sizeof(dep));
	queue<int> q;q.push(0),dep[0]=1;
	while(!q.empty()){
		re int u=q.front();q.pop();
		for(re int i=head[u],v;~i;i=e[i].next)
			if(!dep[v=e[i].v]&&e[i].f)
				dep[v]=dep[u]+1,q.push(v);
	}return dep[n+1];
}
il int dfs(re int u,re int cp)
{
	if(u==n+1)return cp;
	re int awa=cp;
	for(re int &i=cur[u],v;~i&&awa;i=e[i].next)
		if(dep[v=e[i].v]==dep[u]+1&&e[i].f){
			re int k=dfs(v,min(awa,e[i].f));
			if(!k)dep[v]=0;e[i].f-=k,e[i^1].f+=k,awa-=k;
		}return cp-awa;
}
il int dinic()
{
	re int awa=0;
	while(bfs())
		awa+=dfs(0,1e18);
	return awa;
}
signed main()
{memset(head,-1,sizeof(head));
	n=read(); 
	for(re int i=1;i<=n;i++)
		add(0,i,read());
	for(re int i=1;i<=n;i++)
		add(i,n+1,read());
	m=read();
	re int cnt=n+1;
	for(re int i=1;i<=m;i++){
		re int q=read();
		add(0,++cnt,read());
		add(++cnt,n+1,read());
		for(re int j=1,x;j<=q;j++)
			x=read(),add(cnt-1,x,1e12),add(x,cnt,1e12);
	}
	printf("%lld\n",sum-dinic());
	return 0;
}

#include<bits/stdc++.h>
#define pb push_back
#define il inline
#define re register
#define pii pair<int,int>
#define fs first
#define sc second
using namespace std;
il int read()
{
	re int x=0;
	re int ff=1;
	re char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')
			ff=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=x*10+c-'0';
		c=getchar();
	}
	return x*ff;
}
const int N=5e4+6;
const int M=3e5+6;
const int inf=1e6;
struct edge{
	int v,next,f;
};
edge e[M];
int n,m,k,head[N],cur[N],dep[N],id[106][106],s,t,sum;
il void add(re int u,re int v,re int w){(w^inf?sum+=w:0),e[k]={v,head[u],w},head[u]=k;e[++k]={u,head[v],0},head[v]=k++;return;}
il bool bfs(){memset(dep,0,sizeof(dep));queue<int> q;q.push(s),dep[s]=1,cur[s]=head[s];while(!q.empty()){re int u=q.front();q.pop();
for(re int i=head[u],v;~i;i=e[i].next)if(!dep[v=e[i].v]&&e[i].f)cur[v]=head[v],dep[v]=dep[u]+1,q.push(v);}return dep[t];}
il int dfs(re int u,re int cp){if(u==t)return cp;re int awa=cp;for(re int &i=cur[u],v;~i&&awa;i=e[i].next)
if(dep[v=e[i].v]==dep[u]+1&&e[i].f){re int k=dfs(v,min(awa,e[i].f));if(!k)dep[v]=0;e[i].f-=k,e[i^1].f+=k,awa-=k;}return cp-awa;}
il int dinic(){re int awa=0;while(bfs())awa+=dfs(s,1e9);return awa;}
signed main()
{memset(head,-1,sizeof(head));re int cnt=0;n=read(),m=read();s=0,t=n*m+1;
	for(re int i=1;i<=n;i++)for(re int j=1;j<=m;j++)id[i][j]=++cnt,add(s,cnt,read());
	for(re int i=1;i<=n;i++)for(re int j=1;j<=m;j++)add(id[i][j],t,read());cnt++;
	for(re int i=1;i<n;i++)for(re int j=1;j<=m;j++)add(s,++cnt,read()),add(cnt,id[i][j],inf),add(cnt,id[i+1][j],inf);
	for(re int i=1;i<n;i++)for(re int j=1;j<=m;j++)add(++cnt,t,read()),add(id[i][j],cnt,inf),add(id[i+1][j],cnt,inf);
	for(re int i=1;i<=n;i++)for(re int j=1;j<m;j++)add(s,++cnt,read()),add(cnt,id[i][j],inf),add(cnt,id[i][j+1],inf);
	for(re int i=1;i<=n;i++)for(re int j=1;j<m;j++)add(++cnt,t,read()),add(id[i][j],cnt,inf),add(id[i][j+1],cnt,inf);
	printf("%d\n",sum-dinic());return 0;
}