//P8215
#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 10;
const long long inf = 1e17;
int n, m, hd[N], eg[N], nx[N], tot = 1;
int dep[N], now[N];
long long ln[N];

void add(int x, int y, long long z){
	eg[++tot] = y;
	ln[tot] = z;
	nx[tot] = hd[x];
	hd[x] = tot;
	eg[++tot] = x;
	ln[tot] = 0;
	nx[tot] = hd[y];
	hd[y] = tot;
}
bool bfs(int s, int t){
	memset(dep, 0, sizeof(dep));
	memcpy(now, hd, sizeof(hd));
	queue<int> q;
	q.push(s);
	dep[s] = 1;
	while(!q.empty()){
		int x = q.front();
		q.pop();
		for(int i = hd[x]; i; i = nx[i]){
			int y = eg[i];
			long long z = ln[i];
			if(!dep[y] && z > 0){
				dep[y] = dep[x] + 1;
				q.push(y);
				if(y == t){
					return true;
				}
			}
		}
	}
	return false;
}
long long dfs(int x, int t, long long flow){
	if(x == t){
		return flow;
	}
	long long rest = flow;
	for(int i = now[x]; i; i = nx[i]){
		int y = eg[i];
		long long z = ln[i];
		now[x] = i;
		if(z > 0 && dep[y] == dep[x] + 1){
			long long k = dfs(y, t, min(z, rest));
			if(!k){
				dep[y] = 0;
			}
			ln[i] -= k;
			ln[i^1] += k;
			rest -= k;
		}
	}
	return flow - rest;
}
long long dinic(int s, int t){
	long long mf = 0, tmp = 0;
	while(bfs(s, t)){
		while(tmp = dfs(s, t, inf)){
			mf += tmp;
		}
	}
	return mf;
}

int main(){
	scanf("%d%d", &n, &m);
	int s = 3 * n + 1, t = 3 * n + 2;
	#define p(x) (n+n+ceil((x)/2.0))
	for(int i = 1; i <= n + n; ++ i){
		int c, d, e;
		scanf("%d%d%d", &c, &d, &e);
		add(s, i, d);
		add(i, t, c);
		add(p(i), i, inf);
		if(i & 1){
			add(i, i+1, e);
		} else {
			add(i, i-1, e);
		}
	}
	for(int i = 1; i <= m; ++ i){
		int A, B, a, b;
		scanf("%d%d%d%d", &A, &B, &a, &b);
		add(B, p(A), a);
		add(A, p(B), b);
	}
	printf("%lld\n", dinic(s, t));
	return 0;
}