#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
#define N 2050
int n,m,v[N],s[N*10][2],a,b,as[N];
vector<int> s0[N],s1[N];
long long a1;

int head[N],cnt,cur[N],dis[N],vis[N];
struct edge{int t,next,v;}ed[N*59];
void adde(int f,int t,int v)
{
	ed[++cnt]=(edge){t,head[f],v};head[f]=cnt;
	ed[++cnt]=(edge){f,head[t],0};head[t]=cnt;
}
bool bfs(int s,int t)
{
	queue<int> qu;
	for(int i=1;i<=n+2;i++)dis[i]=-1,cur[i]=head[i];
	qu.push(s);dis[s]=0;
	while(!qu.empty())
	{
		int u=qu.front();qu.pop();
		for(int i=head[u];i;i=ed[i].next)if(ed[i].v&&dis[ed[i].t]==-1)
		{
			dis[ed[i].t]=dis[u]+1;qu.push(ed[i].t);
			if(ed[i].t==t)return 1;
		}
	}
	return 0;
}
int dfs(int u,int t,int f)
{
	if(u==t||!f)return f;
	int as=0,tp;
	for(int &i=cur[u];i;i=ed[i].next)
	if(ed[i].v&&dis[ed[i].t]==dis[u]+1&&(tp=dfs(ed[i].t,t,min(f,ed[i].v))))
	{
		ed[i].v-=tp;ed[i^1].v+=tp;
		as+=tp;f-=tp;
		if(!f)return as;
	}
	return as;
}
void dfs1(int u)
{
	if(vis[u])return;vis[u]=1;
	for(int i=head[u];i;i=ed[i].next)if(ed[i].v)dfs1(ed[i].t);
}
void solve(vector<int> si,int l,int r)
{
	if(si.empty())return;
	if(l==r)
	{
		for(int i=0;i<si.size();i++)as[si[i]]=l;
		return;
	}
	int mid=(l+r)>>1;
	for(int i=1;i<=n+2;i++)head[i]=0;cnt=1;
	for(int i=0;i<si.size();i++)
	{
		int u=si[i];
		int rv=s0[u].end()-lower_bound(s0[u].begin(),s0[u].end(),mid+1)-(lower_bound(s1[u].begin(),s1[u].end(),mid+1)-s1[u].begin());
		if(rv>=0)adde(u,n+2,rv);else adde(n+1,u,-rv);
	}
	for(int i=1;i<=m;i++)adde(s[i][1],s[i][0],1e9);
	while(bfs(n+1,n+2))dfs(n+1,n+2,1e9);
	for(int i=1;i<=n+2;i++)vis[i]=0;
	dfs1(n+1);
	vector<int> s1,s2;
	for(int i=0;i<si.size();i++)
	if(vis[si[i]])s1.push_back(si[i]);
	else s2.push_back(si[i]);
	solve(s1,l,mid);solve(s2,mid+1,r);
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&v[i]);
	for(int i=1;i<=m;i++)scanf("%d%d",&s[i][0],&s[i][1]);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a);
		while(a--)scanf("%d",&b),s0[i].push_back(v[i]-b);
		sort(s0[i].begin(),s0[i].end());
	}
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a);
		while(a--)scanf("%d",&b),s1[i].push_back(v[i]+b);
		sort(s1[i].begin(),s1[i].end());
	}
	vector<int> vi;
	for(int i=1;i<=n;i++)vi.push_back(i);
	solve(vi,0,1.1e8);
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<s0[i].size();j++)if(s0[i][j]>as[i])a1+=s0[i][j]-as[i];
		for(int j=0;j<s1[i].size();j++)if(s1[i][j]<as[i])a1+=as[i]-s1[i][j];
	}
	printf("%lld\n",a1);
}