#include<bits/stdc++.h>
using namespace std;
//#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {cerr << "[" << s << "] = [" << x << "]\n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;else if (s[i] == ')' || s[i] == '}') b--;else if (s[i] == ',' && b == 0) {cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);break;}}
#ifdef ONLINE_JUDGE
#define Debug(...)
#else
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 1e18;
const int _ = 2000 + 5;
vi d[_];
int p[_], q[_], a[_][_], b[_][_], h[_];
bool vis[_];
//template<int _, int 1000000>;
struct MCMF {
	int nn, s, t, tot = 1, cur[_], head[_], to[1000000  + 5], nxt[1000000 + 5];
	ll fl[1000000 + 6];
//	void init() {
//		nn = 0, tot = 1;
//	}
	void add(int u, int v, ll w) {
//		cout << " !!! " << u << " " <<v <<" " << w << '\n';
		to[++tot] = v, nxt[tot] = head[u], fl[tot] = w, head[u] = tot;
	}
	void Add(int u, int v, ll w) {
		add(u, v, w), add(v, u, 0);
	}
	int ds[_];
	bool bfs() {
		F(i, 1, t) ds[i] = 0;
		ds[s] = 1;
		queue<int> q;
		q.push(s);
//		memcpy(cur, head, sizeof(int) * (nn + 3));
		while(!q.empty()) {
			int u = q.front();
			q.pop();
			for(int i = head[u], v = to[i]; i; i = nxt[i], v = to[i]) if(!ds[v] && fl[i] > 0) {
				ds[v] = ds[u] + 1, q.push(v);
			}
		}
		return ds[t];
	}
	ll dfs(int x, ll in) {
		if(x == t) return in;
		ll out = 0;
		for(int &i = cur[x]; i && in; i = nxt[i]) if(fl[i] > 0 && ds[to[i]] == ds[x] + 1) {
			ll p = dfs(to[i], min(in, fl[i]));
			fl[i] -= p, fl[i ^ 1] += p;
			in -= p, out += p;
		}
		return out;
	}
	void oo(int x) {
		vis[x] = 1;
		for(int i = head[x]; i; i = nxt[i]) if(fl[i] > 0 && !vis[to[i]]) oo(to[i]);
	}
} G;
int n, m, pk[_];
ll vw[_];
int ans[_];
//MCMF<2005, 1000005> G;

ll Fg(int u, int x) {
	ll s = 0;
	F(i, 1, p[u]) s += max(0, -x + h[u] - a[u][i]);
	F(i, 1, q[u]) s += max(0, x - h[u] - b[u][i]);
	return s;
}
void solve(vi g, int l, int r) {
//	for(int v : g) cout << v << ' ';
//	cout << " ( " << l << " " << r << " ) \n";
	if(g.empty()) return;
	if(l == r) {
		for(int v : g) ans[v] = l;
		return;
	}
	int mid = (l + r) >> 1;
	F(i, 1, G.nn) G.head[i] = G.cur[i] = vis[i] = 0;
	G.nn = 0, G.tot = 1;
	for(int v : g) pk[v] = ++G.nn;
	G.s = ++G.nn, G.t = ++G.nn;
	F(i, 1, G.nn) G.head[i] = G.cur[i] = vis[i] = 0;
	for(int i : g) {
		vw[i] = Fg(i, mid + 1) - Fg(i, mid);
//		cout << vw[i] << "!!\n";
		if(vw[i] > 0) G.Add(G.s, pk[i], vw[i]);
		else G.Add(pk[i], G.t, -vw[i]);
	}
	for(int a : g) for(int b : d[a]) if(pk[b]) G.Add(pk[b], pk[a], infll);
//	Debug(G.tot);
	while(G.bfs()) {
		F(i, 1, G.nn) G.cur[i] = G.head[i];
		G.dfs(G.s, infll);
	}
	G.oo(G.s);
//	F(i, 1, n) cout << vis[i] << " ";
//	cout << " fuck\n";
	vi t1, t2;
	for(int v : g) if(vis[pk[v]]) t1.pb(v); else t2.pb(v);
	for(int v : g) pk[v] = 0;
	solve(t1, l, mid), solve(t2, mid + 1, r);
}
bool Med;
signed main() {
	// Mry;
	n = ri(), m = ri();
	F(i, 1, n) h[i] = ri();
	F(i, 1, m) {
		int u = ri(), v = ri();
		d[u].pb(v);
	}
	F(i, 1, n) {
		p[i] = ri();
		F(j, 1, p[i]) a[i][j] = ri();
	}
	F(i, 1, n) {
		q[i] = ri();
		F(j, 1, q[i]) b[i][j] = ri();
	}
	vi g;
	F(i, 1, n) g.pb(i);
	solve(g, -2e8, 2e8);
	ll Ans = 0;
	F(i, 1, n) Ans += Fg(i, ans[i]);
//	F(i, 1, n) cout << ans[i] <<' ';
//	cout << '\n';
	printf("%lld\n", Ans);
	// Try;
	return 0;
}