//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
int a,b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c, d,e,f;
};
int n,m,s0,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l,l2,r2,l3,l4;
int i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
/// fin(task),fou(task);
#endif
NHP
/// cin>>s1;
// modwwe
phongbeo(),down
}
ic a[1000007];
ic b[1000007];
int dp[2004][2004];
void phongbeo()
{ cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>a[i].a>>a[i].b>>a[i].c,
a[i].a+=a[i-1].a;
for(int i=1; i<=m; i++)
cin>>b[i].a>>b[i].b>>b[i].c,
b[i].a+=b[i-1].a;
for(int i=0;i<=n;i++)
for(int j=0;j<=m;j++)
dp[i][j]=-1e18;
dp[0][0]=0;
for(int i=0;i<=n;i++)
for(int j=0;j<=m;j++)
{
s2=0;
s3=0;
if(b[j+1].a+a[i].a<=b[j+1].b)s3=b[j+1].c;
if(a[i+1].a+b[j].a<=a[i+1].b) s2=a[i+1].c;
dp[i+1][j]=max(dp[i][j]+s2,dp[i+1][j]);
dp[i][j+1]=max(dp[i][j]+s3,dp[i][j+1]);
}
cout<<dp[n][m];
}
