#include <bits/stdc++.h>
#define R(x) x = read()
#define ENDL push('\n');
#define SPACE push(' ');
#define int long long
using namespace std;
char pbuf[1<<20], *pp=pbuf;
inline void push(const char &c) {
	if(pp - pbuf == 1<<20)fwrite(pbuf, 1, 1<<20, stdout),pp = pbuf;
	*pp++ = c;
}
class io {public:~io() {fwrite(pbuf, 1, pp - pbuf, stdout);}} _;
inline void write(int x) {
	if (x<0)x=-x,push('-');
	int sta[35],top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while (x);
	while(top)push(sta[--top]^'0');
}
int n,m;
int s,t;
struct edge{
	int to,nxt,flow;
}v[9000100];
int len=1,fir[5010];
void add(int x,int y,int w){
	++len;
	v[len].to=y;
	v[len].nxt=fir[x];
	v[len].flow=w;
	fir[x]=len;
}
int s1,s2,t1,t2;
int in[5010],out[5010];
const int inf=1e17;
int sum,ans;
int fir2[5010],d[5010];
int bfs(){
	queue<int> q;
	q.push(s);
	memset(d,-1,sizeof(d));
	d[s]=1;
	while(!q.empty()){
		int u=q.front();
		q.pop();
		if(u==t)return 1;
		for(int i=fir[u];i;i=v[i].nxt){
			if(v[i].flow<=0||d[v[i].to]^(-1))continue;
			d[v[i].to]=d[u]+1;
			q.push(v[i].to);
		}
	}
	return 0;
}
int dfs(int u,int val){
	if(u==t||!val)return val;
	int tmp=0;
	for(int &i=fir2[u];i;i=v[i].nxt){
		if(v[i].flow<=0||d[v[i].to]!=d[u]+1)continue;
		int cut=dfs(v[i].to,min(val,v[i].flow));
		val-=cut;
		v[i].flow-=cut;
		v[i^1].flow+=cut;
		tmp+=cut;
		if(!val)break;
	}
	if(!tmp)d[u]=-1;
	return tmp;
}
int dinic(){
	int mincut=0;
	while(bfs()){
		memcpy(fir2,fir,sizeof(fir));
		mincut+=dfs(s,inf);
	}
	return mincut;
}
signed main(){
	while(cin >> n >> m){
		len=1;
		sum=0;
		memset(fir,0,sizeof(fir));
		memset(in,0,sizeof(in));
		memset(out,0,sizeof(out));
		s1=n+m+1;
		t1=s1+1;
		s2=t1+1;
		t2=s2+1;
		s=s2;
		t=t2;
		for(int i=1;i<=m;i++){
			int g;
			cin >> g;
			in[t1]+=g;
			out[i+n]+=g;
			add(i+n,t1,inf-g);
			add(t1,i+n,0);
		}
		for(int i=1;i<=n;i++){
			int c,d;
			cin >> c >> d;
			add(s1,i,d);
			add(i,s1,0);
			for(int j=1;j<=c;j++){
				int T,L,R;
				cin >> T >> L >> R;
				T++;
				add(i,T+n,R-L);
				add(T+n,i,0);
				in[T+n]+=L;
				out[i]+=L;
			}
		}
		for(int i=1;i<=t1;i++){
			if(in[i]>out[i]){
				sum+=in[i]-out[i];
				add(s,i,in[i]-out[i]);
				add(i,s,0);
			}else{
				add(i,t,out[i]-in[i]);
				add(t,i,0);
			}
		}
		add(t1,s1,inf);
		add(s1,t1,0);
		if(dinic()^sum){
			write(-1);
			push('\n');
			push('\n');
			continue;
		}
		ans=v[len].flow;
		v[len].flow=v[len^1].flow=0;
		s=s1;
		t=t2;
		ans+=dinic();
		write(ans);
		push('\n');
		push('\n');
	}
    return 0;
}

https://www.luogu.com.cn/record/126911180