#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <set>
#include <list>
#include <map>
#include <cstdlib>
#include <bitset>
#include <limits.h>
using namespace std;
#define int long long
//#define double long double
#define fi first 
#define se second
#define INF 0x3f3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define FILL(a,b) (memset(a,b,sizeof(a)))
#define ios std::ios::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0);
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define pb push_back
#define all(x) x.begin(),x.end()
#define SZ(x) x.size()
#define endl '\n'
#define rep(i,j,k,l) for(int i=j;i<=k;i+=l)
#define per(i,j,k,l) for(int i=j;i>=k;i-=l)
#define Rep(i,j,k,l) for(int i=j;i<k;i+=l)
#define Per(i,j,k,l) for(int i=j;i>k;i-=l)
#define ls u<<1
#define rs u<<1|1
const int N=400010,mod=998244353;
const double eps=1e-8;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef long long ll;
int n,m,S,T;
int h[N],e[N],ne[N],f[N],idx;
void add(int a,int b,int c)
{
	e[idx]=b,f[idx]=c,ne[idx]=h[a],h[a]=idx++;
	e[idx]=a,f[idx]=0,ne[idx]=h[b],h[b]=idx++;
}
int q[N],dis[N],cur[N];
bool bfs()
{
	FILL(dis,-1);
	int hh=0,tt=0;
	q[0]=S,dis[S]=0,cur[S]=h[S];
	while(hh<=tt)
	{
		int t=q[hh++];
		for(int i=h[t];i!=-1;i=ne[i])
		{
			int j=e[i];
			if(dis[j]==-1&&f[i])
			{
				dis[j]=dis[t]+1;
				cur[j]=h[j];
				if(j==T) return true;
				q[++tt]=j;
			}
		}
	}
	return false;
}
int dfs(int u,int limit)
{
	if(u==T) return limit;
	int flow=0;
	for(int i=cur[u];i!=-1&&flow<limit;i=ne[i])
	{
		cur[u]=i;
		int j=e[i];
		if(dis[j]==dis[u]+1&&f[i])
		{
			int t=dfs(j,min(f[i],limit-flow));
			if(!t) dis[j]=-1;
			f[i]-=t,f[i^1]+=t,flow+=t;
		}
	}
	return flow;
}
int dinic()
{
	int ans=0,flow;
	while(bfs()) while(flow=dfs(S,INF)) ans+=flow;
	return ans;
}
void solve()
{
	FILL(h,-1);
	cin>>n>>m;
	S=0,T=N-1;
	for(int i=1;i<=2*n;i++)
	{
		int C,D,E;
		cin>>C>>D>>E;
		add(S,i,D);
		add(i,i%2?i+1:i-1,E);
		add(2*n+((i+1)>>1),T,C);
		add(i,2*n+((i+1)>>1),C);
		add(2*n+((i+1)>>1),i,INF);
	}
	while(m--)
	{
		int x,y,a,b;
		cin>>x>>y>>a>>b;
		add(2*n+((y+1)>>1),x,b);
		add(y,2*n+((x+1)>>1),a);
	}
	cout<<dinic();
}
signed main()
{
	ios
	int t=1;
	//cin>>t;
	while(t--) solve();
	return 0;
}