#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <vector>
#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;

typedef long long LL;
typedef pair<int, LL> PII;
typedef set<PII>::iterator SIT;

const int N = 1e6 + 5;

int n, m, A[N], P[N], x[N], y[N];

int B[N], Q[N];

LL S[N], T[N], sa[N], sb[N];

LL res, ans;

set<PII> s;

vector<PII> e[N];

void inline add(int x, int y, int c) {
    if (x < 0 || x > n || y < 0 || y > m) return;
    e[x].pb(mp(y, c));
}

void inline chkMax(LL &x, LL y) {
    if (y > x) x = y;
}

void inline insert(int x, int y) {
    SIT it = s.lower_bound(mp(x, 0));
    PII o = mp(x, y);
    if (it -> fi == x) {
        o = *it;
        s.erase(it);
        o.se += y;
    } 
    if (o.se == 0) return;
    if (o.se < 0) {
        LL t = -o.se;
        while (1) {
            it = s.lower_bound(mp(x, 0));
            if (it == s.end()) break;
            LL d = min(t, it -> se);
            PII b = *it; s.erase(it);
            b.se -= d; t -= d;
            if (b.se > 0) s.insert(b);
            if (t == 0) break;
        }
    } else {
        s.insert(o);
    }
}


int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) 
        scanf("%d%lld%d", A + i, S + i, P + i), sa[i] = sa[i - 1] + A[i];
    for (int i = 1; i <= m; i++)
        scanf("%d%lld%d", B + i, T + i, Q + i), sb[i] = sb[i - 1] + B[i];
    
    for (int i = 1; i <= n; i++) {
        int l = 0, r = m;
        while (l < r) {
            int mid = (l + r + 1) >> 1;
            if (sb[mid] + sa[i] <= S[i]) l = mid;
            else r = mid - 1;
        }
        if (sb[r] + sa[i] <= S[i]) y[i] = r;
        else y[i] = -1;
    }
    
    for (int i = 1; i <= m; i++) {
        int l = 0, r = n;
        while (l < r) {
            int mid = (l + r + 1) >> 1;
            if (sb[i] + sa[mid] <= T[i]) l = mid;
            else r = mid - 1;
        }
        if (sb[i] + sa[r] <= T[i]) x[i] = r;
        else x[i] = -1;
    }
    
    for (int i = 1; i <= n; i++) {
        if (y[i] >= 0) {
            res += P[i];
            add(i - 1, y[i] + 1, -P[i]);
        }
    }
    
    for (int i = 1; i <= m; i++) {
        if (x[i] >= 0) add(x[i], i, Q[i]);
    }
    
    for (int i = 0; i <= n; i++) {
        sort(e[i].begin(), e[i].end(), greater<PII>() );
    }
    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < e[i].size(); j++) {
            PII v = e[i][j];
            insert(v.fi, v.se);
        }
    }
    
    for (SIT u = s.begin(); u != s.end(); u++) res += u -> se;   
    for (int i = 0; i < e[n].size(); i++) res += e[n][i].se;
    printf("%lld\n", res);
    return 0;
}