#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e6;
int N, M;
ll A[MAXN+10], S[MAXN+10], P[MAXN+10];
ll B[MAXN+10], T[MAXN+10], Q[MAXN+10];
ll ans;
struct Point
{
int x, y; ll w;
};
vector<Point> V;
ll tree[MAXN*4+10];
bool lazy[MAXN*4+10];
void busy(int node, int tl, int tr)
{
if(!lazy[node]) return;
tree[node]=0;
if(tl!=tr) lazy[node*2]=true, lazy[node*2+1]=true;
lazy[node]=false;
}
ll query(int node, int tl, int tr, int l, int r)
{
busy(node, tl, tr);
if(r<tl || tr<l) return 0;
if(l<=tl && tr<=r) return tree[node];
int mid=tl+tr>>1;
ll t=query(node*2, tl, mid, l, r)+query(node*2+1, mid+1, tr, l, r);
return t;
}
int query2(int node, int tl, int tr, ll v)
{
busy(node, tl, tr);
if(tl==tr) return tl;
ll t=0;
if(!lazy[node*2]) t=tree[node*2];
int mid=tl+tr>>1;
if(t>v) return query2(node*2, tl, mid, v);
else return query2(node*2+1, mid+1, tr, v-t);
}
void update1(int node, int tl, int tr, int p, ll v)
{
busy(node, tl, tr);
if(tr<p) return;
if(tl==tr)
{
tree[node]+=v;
return;
}
int mid=tl+tr>>1;
if(p<=mid) update1(node*2, tl, mid, p, v);
else update1(node*2+1, mid+1, tr, p, v);
tree[node]=0;
if(!lazy[node*2]) tree[node]+=tree[node*2];
if(!lazy[node*2+1]) tree[node]+=tree[node*2+1];
}
void update2(int node, int tl, int tr, int l, int r)
{
busy(node, tl, tr);
if(r<l) return;
if(l<=tl && tr<=r)
{
lazy[node]=true;
busy(node, tl, tr);
return;
}
if(r<tl || tr<l) return;
int mid=tl+tr>>1;
update2(node*2, tl, mid, l, r);
update2(node*2+1, mid+1, tr, l, r);
tree[node]=tree[node*2]+tree[node*2+1];
}
int main()
{
int i, j;
scanf("%d%d", &N, &M);
for(i=1; i<=N; i++) scanf("%lld%lld%lld", &A[i], &S[i], &P[i]), A[i]+=A[i-1];
for(i=1; i<=M; i++) scanf("%lld%lld%lld", &B[i], &T[i], &Q[i]), B[i]+=B[i-1];
for(i=1; i<=N; i++)
{
if(A[i]>S[i]) continue;
int x=i, y=upper_bound(B+1, B+M+1, S[i]-A[i])-B-1;
ans+=P[i];
if(y!=M)
{
x--; y++;
if(x!=N && y!=0) V.push_back({x, y, -P[i]});
}
}
for(i=1; i<=M; i++)
{
if(B[i]>T[i]) continue;
int y=i, x=upper_bound(A+1, A+N+1, T[i]-B[i])-A-1;
if(x!=N && y!=0) V.push_back({x, y, Q[i]});
else ans+=Q[i];
}
sort(V.begin(), V.end(), [&](const Point &p, const Point &q)
{
if(p.x!=q.x) return p.x<q.x;
if(p.y!=q.y) return p.y>q.y;
return p.w>q.w;
});
for(i=0; i<V.size(); i++)
{
int y=V[i].y; ll w=V[i].w;
if(w>=0) update1(1, 0, M, y, w);
else
{
ll t=query(1, 0, M, 0, y-1)-w;
int pt=M+1;
if(query(1, 0, M, 0, M)>t) pt=query2(1, 0, M, t);
ll p=query(1, 0, M, 0, pt), q=query(1, 0, M, pt, pt);
update2(1, 0, M, y, pt-1);
update1(1, 0, M, pt, -q+p-t);
}
}
ans+=query(1, 0, M, 0, M);
printf("%lld\n", ans);
}
