#include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, l, r) for(int i = (l) - 1; i >= (r); --i)
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define sz(v) (int)v.size()
#define sum_of(v) accumulate(all(v), 0ll)
#define pb push_back
#define eb emplace_back
#define compact(v) v.erase(unique(all(v)), end(v))
#define dbg(x) "[" #x " = " << (x) << "]"
#define file(task) if(fopen(task".inp", "r")){ \
freopen(task".inp", "r", stdin); \
freopen(task".out", "w", stdout); }
template<typename T>
bool minimize(T& a, const T& b){
if(a > b) return a = b, true;
return false;
}
template<typename T>
bool maximize(T& a, const T& b){
if(a < b) return a = b, true;
return false;
}
using ll = long long;
using db = double;
using ld = long double;
using ull = unsigned long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vd = vector<db>;
using vpi = vector<pi>;
using vpl = vector<pl>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAX = 1e6 + 5;
int N, M, A[MAX], B[MAX], P[MAX], Q[MAX];
ll S[MAX], T[MAX];
void testcase(int num_testcase){
cin >> N >> M;
FOR(i, 1, N + 1) cin >> A[i] >> S[i] >> P[i];
FOR(i, 1, M + 1) cin >> B[i] >> T[i] >> Q[i];
vector<vl> dp(N + 1, vl(M + 1));
vl sumA(N + 1), sumB(M + 1);
FOR(i, 0, N) sumA[i + 1] = sumA[i] + A[i + 1];
FOR(i, 0, M) sumB[i + 1] = sumB[i] + B[i + 1];
dp[0][0] = 0;
FOR(i, 0, N + 1){
FOR(j, (i == 0), M + 1){
dp[i][j] = LLONG_MIN;
ll t = sumA[i] + sumB[j];
if(i > 0) maximize(dp[i][j], dp[i - 1][j] + (t <= S[i] ? P[i] : 0));
if(j > 0) maximize(dp[i][j], dp[i][j - 1] + (t <= T[j] ? Q[j] : 0));
}
}
cout << dp[N][M] << '\n';
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
file("task");
int T = 1;
// cin >> T;
FOR(i, 0, T) testcase(i);
return 0;
}
