#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=1e6+5;
const ll inf=1e18;
ll a[MAXN],s[MAXN],p[MAXN],b[MAXN],t[MAXN],q[MAXN],ans=0;
vector <array<ll,2>> f[MAXN];
map <int,ll> dp;
inline void add(int id,ll val) {
	for(auto it=dp.lower_bound(id);val<0;it=dp.erase(it)) id=it->first,val+=it->second;
	dp[id]+=val;
}
signed main() {
	ios::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;++i) cin>>a[i]>>s[i]>>p[i],a[i]+=a[i-1];
	for(int i=1;i<=m;++i) cin>>b[i]>>t[i]>>q[i],b[i]+=b[i-1];
	for(int i=1;i<=n;++i) if(s[i]>=a[i]) {
		int j=upper_bound(b+1,b+m+1,s[i]-a[i])-b;
		ans+=p[i];
		if(j<=m) f[i].push_back({j,-p[i]});
	}
	for(int j=1;j<=m;++j) if(t[j]>=b[j]) {
		int i=upper_bound(a+1,a+n+1,t[j]-b[j])-a;
		if(i<=n) f[i].push_back({j,q[j]});
		else ans+=q[j];
	}
	dp[m+1]=inf;
	for(int i=1;i<=n;++i) {
		sort(f[i].begin(),f[i].end(),[&](auto x,auto y){ return x[1]>y[1]; });
		for(auto k:f[i]) add(k[0],k[1]);
	}
	for(auto x:dp) if(x.first<=m) ans+=x.second;
	cout<<ans<<"\n";
	return 0;
}