#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
const ll N=5000009,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;}
struct MF {
  struct edge {
    int v, nxt, cap, flow;
  } e[N];

  int fir[N], cnt = 0;

  int n, S, T;
  ll maxflow = 0;
  int dep[N], cur[N];

  void init() {
    memset(fir, -1, sizeof fir);
    cnt = 0;
  }

  void add(int u, int v, int w) {
    e[cnt] = {v, fir[u], w, 0};
    fir[u] = cnt++;
    e[cnt] = {u, fir[v], 0, 0};
    fir[v] = cnt++;
  }

  bool bfs() {
    queue<int> q;
    memset(dep, 0, sizeof(int) * (n + 1));

    dep[S] = 1;
    q.push(S);
    while (q.size()) {
      int u = q.front();
      q.pop();
      for (int i = fir[u]; ~i; i = e[i].nxt) {
        int v = e[i].v;
        if ((!dep[v]) && (e[i].cap > e[i].flow)) {
          dep[v] = dep[u] + 1;
          q.push(v);
        }
      }
    }
    return dep[T];
  }

  int dfs(int u, int flow) {
    if ((u == T) || (!flow)) return flow;

    int ret = 0;
    for (int& i = cur[u]; ~i; i = e[i].nxt) {
      int v = e[i].v, d;
      if ((dep[v] == dep[u] + 1) &&
          (d = dfs(v, min(flow - ret, e[i].cap - e[i].flow)))) {
        ret += d;
        e[i].flow += d;
        e[i ^ 1].flow -= d;
        if (ret == flow) return ret;
      }
    }
    return ret;
  }

  ll dinic() {
    while (bfs()) {
      memcpy(cur, fir, sizeof(int) * (n + 1));
      maxflow += dfs(S, INF);
    }
    return maxflow;
  }
} F;
int a, b;
int id(int n) {return (n + 1) / 2 + a * 2;}

signed main() {
	// freopen("in2.in", "r", stdin);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a >> b;
	F.init();
	F.n=3*a+3;
	const int S = 3 * a + 1, T = 3 * a + 2;
	F.S = S, F.T = T;
	int x, y, z, w;
	for(ll i=1;i<=2*a;i++){
		cin >> x >> y >> z;
		F.add(i, T, x), F.add(S, i, y), F.add(i, i & 1 ? i + 1 : i - 1, z);
	}
	for(ll i=1;i<=a;i++) F.add(i + a * 2, i * 2 - 1, INF), F.add(i + a * 2, i * 2, INF);
	for(ll i=1;i<=b;i++){
		cin >> x >> y >> z >> w;
		F.add(y, id(x), z), F.add(id(y), x, w);
	}
	cout << F.dinic();
	return 0;
}