#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e3+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
ll n,m,a[N],s[N],p[N],b[N],t[N],q[N],dp[N][N],f[N],ans;
vector<pll> lis;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>m;
REP1(i,n)cin>>a[i]>>s[i]>>p[i],a[i]+=a[i-1];
REP1(i,m)cin>>b[i]>>t[i]>>q[i],b[i]+=b[i-1],lis.pb(mp(t[i]-b[i],i));
sort(lis.rbegin(),lis.rend());
f[1]=0;f[2]=-INF;
REP1(i,n+1)REP1(j,m+1)dp[i][j]=-INF;
dp[1][1]=0;
REP1(i,n+1){
REP1(j,m){
ll tmp=max(f[j+1],t[j]-b[j]>=a[i-1]?q[j]:0LL);
if(tmp>f[j+1]){
f[j+2]+=f[j+1]-tmp;
}
f[j+1]=tmp;
}
ll id=lwb(b+1,b+m+1,s[i]-a[i]+1)-b;
if(s[i]-a[i]<b[0])id=0;
f[1]+=p[i];f[id+1]-=p[i];
REP1(j,m){
dp[i+1][j]=dp[i][j]+(s[i]-a[i]>=b[j-1]?p[i]:0LL);
}
}
REP1(i,m+1)ans+=f[i];
cout<<ans<<"\n";
return 0;
}
