#include <bits/stdc++.h>

using namespace std;

const int inf = 0x3FFFFFFF;

const int maxn = 2222;

struct node{

    int st, en, flow, cost, next;

    node(){}

    node(int st, int en, int flow, int cost, int next):st(st),en(en),flow(flow),cost(cost),next(next){}

}E[101000];

int num, p[maxn];

void init(){

    memset(p, -1, sizeof(p));

    num = 0;

}

void add(int st, int en, int flow, int cost){

    E[num] = node(st, en, flow, cost, p[st]);

    p[st] = num++;

    E[num] = node(en, st, 0, -cost, p[en]);

    p[en] = num++;

}

int pre[maxn];

int dis[maxn];

bool fg[maxn];

bool spfa(int st, int en)

{

    for(int i=0;i<=en;i++){

        fg[i] = 0, dis[i] = inf, pre[i]=-1;

    }

    queue<int>q;

    q.push(st);

    fg[st]=1;

    dis[st]=0;

    while(!q.empty()){

        int u = q.front(); q.pop();

        fg[u]=0;

        for(int i=p[u];~i;i=E[i].next){

            int v = E[i].en;

            if(E[i].flow&&dis[v]>dis[u]+E[i].cost){

                dis[v] = dis[u]+E[i].cost;

                pre[v]=i;

                if(!fg[v]){

                    fg[v]=1;

                    q.push(v);

                }

            }

        }

    }

//    if(dis[en] < inf) return 1;

//    return 0;

    return dis[en]<=0;

}

int solve(int st, int en){

    int ans=0;

    while(spfa(st,en)){

        int d = inf;

        for(int i=pre[en];i+1;i=pre[E[i].st]) d = min(d, E[i].flow);

        for(int i=pre[en];i+1;i=pre[E[i].st]){

            E[i].flow -= d;

            E[i^1].flow += d;

            ans += d*E[i].cost;

        }

    }

    return ans;

}

int main()

{

    int n,m;

    while (cin>>n>>m)

    {

        init();

        int s=0,t=n+1,cost;

        for (int i=1; i<=n; i++)

        {

            int a,b,c,d;

            cin>>a>>b>>c>>d;

            add(s,i,b,a);

            add(i,t,d,-c);

        }

        while (m--)

        {

            int u,v,k;

            cin>>u>>v>>k;

            add(u,v,inf,k);

            add(v,u,inf,k);

        }

        int ans = -solve(s,t);

        printf("%d\n", ans);

    }

    return 0;

}