#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N = 1e6 + 5;
const ll inf = LLONG_MAX/5;
const ll mod = 998244353;
#define bit(x,y) ((x >> y) & 1)
ll d[1005][1005];
ll a[N],sa[N],pa[N],b[N],sb[N],pb[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
ll m;
cin >> n >> m;
ll i,j;
for(i = 1;i <= n;i++)
{
cin >> a[i] >> sa[i] >> pa[i];
a[i] += a[i - 1];
}
for(i = 1;i <= m;i++)
{
cin >> b[i] >> sb[i] >> pb[i];
b[i] += b[i - 1];
}
d[0][0] = 0;
for(i = 1;i <= m;i++)
{
if(b[i] <= sb[i]) d[0][i] = d[0][i - 1] + pb[i];
else d[0][i] = d[0][i - 1];
}
for(i = 1;i <= n;i++)
{
if(a[i] <= sa[i]) d[i][0] = d[i - 1][0] + pa[i];
else d[i][0] = d[i - 1][0];
for(j = 1;j <= m;j++)
{
ll t1 = 0;
if(a[i] + b[i] <= sa[i]) t1 = pa[i];
ll t2 = 0;
if(a[i] + b[i] <= sb[i]) t2 = pb[i];
if(t1 >= t2) d[i][j] = d[i - 1][j] + t1;
else d[i][j] = d[i][j - 1] + t2;
}
}
cout << d[n][m];
}
