#include <bits/stdc++.h>

#define R register
#define ll long long
#define cmax(a, b) ((a < b) ? b : a)
#define cmin(a, b) ((a < b) ? a : b)
#define sum(a, b, mod) ((a + b) % mod)

const ll MaxN = 4e4 + 10;
const ll MaxM = 5e5 + 10;
const ll inf = (1 << 30);

struct edge {
    ll to, next, cap;
};

edge e[MaxM];
ll head[MaxN], dep[MaxN], cur[MaxN];
ll n, m, s = 30000, t = 30001, cnt = 1, ans;

inline void add(ll u, ll v, ll c) {
    ++cnt;
    e[cnt].to = v;
    e[cnt].next = head[u];
    e[cnt].cap = c;
    head[u] = cnt;
}

inline void add_edge(ll u, ll v, ll c) {
    add(u, v, c), add(v, u, 0);
}

inline ll read() {
    ll x = 0;
    char ch = getchar();

    while (ch > '9' || ch < '0')
        ch = getchar();

    while (ch <= '9' && ch >= '0')
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();

    return x;
}

inline ll bfs() {
    memset(dep, 0, sizeof(dep));
    memcpy(cur, head, sizeof(head));
    std::queue<ll> q;
    dep[s] = 1;
    q.push(s);

    while (!q.empty()) {
        ll u = q.front();
        q.pop();

        for (ll i = head[u]; i; i = e[i].next) {
            ll v = e[i].to, c = e[i].cap;

            if (dep[v] || !c)
                continue;

            dep[v] = dep[u] + 1;
            q.push(v);
        }
    }

    return dep[t];
}

inline ll dinic(ll u, ll flow) {
    if (u == t)
        return flow;

    ll rest = flow;

    for (ll i = cur[u]; i && (flow - rest < flow); i = e[i].next) {
        cur[u] = i;
        ll v = e[i].to, c = e[i].cap;

        if (dep[v] != dep[u] + 1 || !c)
            continue;

        ll k = dinic(v, cmin(rest, c));

        if (!k)
            dep[v] = -1;
        else {
            e[i].cap -= k;
            e[i ^ 1].cap += k;
            rest -= k;
        }
    }

    if (flow - rest < flow)
        dep[u] = -1;

    return flow - rest;
}

inline void solve() {
    ll now = 0;

    while (bfs())
        while ((now = dinic(s, inf)))
            ans += now;
}

ll C[MaxN], D[MaxN], E[MaxN];

signed main() {
    n = read(), m = read();

    for (ll i = 1; i <= n * 2; i++)
        C[i] = read(), D[i] = read(), E[i] = read();

    for (ll i = 1, j = 1; i <= 2 * n; i += 2, j++) {
        add_edge(s, i, D[i]), add_edge(s, i + 1, D[i + 1]);
        add_edge(i, i + 1, E[i]), add_edge(i + 1, j + 2 * n, C[i + 1]);
        add_edge(i, j + 2 * n, C[i]), add_edge(i + 1, i, E[i + 1]);
        add_edge(2 * n + j, i, inf), add_edge(2 * n + j, i + 1, inf);
        add_edge(2 * n + j, t, C[i] + C[i + 1]);
    }

    for (ll i = 1; i <= m; i++) {
        ll A = read(), B = read(), a = read(), b = read();
        add_edge(B, 2 * n + (A + 1) / 2, a);
        add_edge(2 * n + (B + 1) / 2, A, b);
    }

    solve(), printf("%lld\n", ans);
    return 0;
}