#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=100009,INF=1e18;
inline int read(){int x=0,f=1; char ch=getchar(); while(ch<'0'||ch>'9'){ if(ch=='-')f=-1; ch=getchar(); } while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;}
void write(int x){if(x<0) putchar('-'),x=-x;if(x>9) write(x/10); putchar(x%10+'0');return;}
ll n,a[N];
ll s,t,nE=1,m;
ll to[N],nxt[N],hd[N],cap[N];
void adde(ll u,ll v,ll c){
    nE++;
    to[nE]=v;
    nxt[nE]=hd[u];
    hd[u]=nE;
    cap[nE]=c;
}
void add(ll u,ll v,ll c){
	adde(u,v,c);
	adde(v,u,0);
}
ll lv[N];
bool vst[N];
bool bfs(){
    fill(lv,lv+1+nE,0);
    queue<ll> q;
    lv[s]=1;
    q.push(s);
    while(!q.empty()){
        ll u=q.front(); q.pop();
        for(ll i=hd[u];i;i=nxt[i]){
            ll c=cap[i];
            if(!c) continue;
            ll v=to[i];
            if(lv[v]) continue;
            q.push(v);
            lv[v]=lv[u]+1;
        }
    }
    return lv[t];
}
ll maxflow(ll s,ll f){
    ll sum=0;
    if(s==t) return f;
    for(ll i=hd[s];i;i=nxt[i]){
        ll v=to[i];
        ll c=cap[i];
        if(!c) continue;
        if(lv[v]!=lv[s]+1) continue;
        ll delta=maxflow(v,min(f,c));
        sum+=delta;
        f-=delta;
        cap[i]-=delta;
        cap[i^1]+=delta;
    }
    return sum;
}
void Dinic(){
    ll ans=0;
    while(bfs()){
        ans+=maxflow(s,INF);
    }
    cout<<ans<<endl;
}
int main(){
    cin>>n>>m;
    s=0; t=3*n+1;
    for(ll i=1,c,d,e;i<=2*n;i++){
    	cin>>c>>d>>e;
    	add(s,i,d);
    	add(i,2*n+((i+1)/2),c);
    	add(2*n+(i+1)/2,t,c);
    	add(i,(i%2?i+1:i-1),e);
    	add(2*n+(i+1)/2,i,INF);
    }
    for(ll i=1;i<=m;i++){
    	int x,y,a,b; cin>>x>>y>>a>>b;
    	add(2*n+(y+1)/2,x,b);
    	add(y,2*n+(x+1)/2,a);
    }
    Dinic();
	return 0;
	
}