// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#define debug(...) ((void)0)
#endif
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int N, M; cin >> N >> M;
vector<int> A(N + 1), P(N + 1);
vector<int64_t> S(N + 1);
for (int i = 1; i <= N; ++i)
cin >> A[i] >> S[i] >> P[i];
vector<int> B(M + 1), Q(M + 1);
vector<int64_t> T(M + 1);
for (int i = 1; i <= M; ++i)
cin >> B[i] >> T[i] >> Q[i];
vector<int64_t> preA(N + 1, 0);
for (int i = 1; i <= N; ++i)
preA[i] = preA[i - 1] + A[i];
vector<int64_t> preB(M + 1, 0);
for (int i = 1; i <= M; ++i)
preB[i] = preB[i - 1] + B[i];
vector<int64_t> boundP(N + 1, 0);
for (int i = 1; i <= N; ++i)
boundP[i] = (upper_bound(AI(preB), S[i] - preA[i]) - begin(preB)) - 1;
vector<int64_t> boundQ(M + 1, 0);
for (int i = 1; i <= M; ++i)
boundQ[i] = (upper_bound(AI(preA), T[i] - preB[i]) - begin(preA)) - 1;
int64_t ans = 0;
vector<int64_t> dp_diff(M + 1, 0);
vector<vector<int64_t>> out(N + 1);
for (int j = 0; j <= M; ++j)
if (boundQ[j] >= N)
ans += Q[j];
else if (boundQ[j] >= 0)
out[boundQ[j] + 1].emplace_back(j);
set<int> not_zero;
vector<int> modified;
for (int i = 1; i <= N; ++i) {
if (boundP[i] >= 0) {
ans += P[i];
if (boundP[i] < M) {
dp_diff[boundP[i] + 1] -= P[i];
not_zero.emplace(boundP[i] + 1);
modified.emplace_back(boundP[i] + 1);
}
}
for (const int& j: out[i]) {
dp_diff[j] += Q[j];
not_zero.emplace(j);
modified.emplace_back(j);
}
sort(AI(modified));
for (const int& j: modified) {
auto it = not_zero.lower_bound(j);
auto ti = it;
int64_t lst = 0;
while (it != end(not_zero)) {
dp_diff[*it] += lst;
if (dp_diff[*it] >= 0) break;
lst = dp_diff[*it];
dp_diff[*it] = 0;
++it;
}
not_zero.erase(ti, it);
}
modified.clear();
}
cout << accumulate(AI(dp_diff), ans) << '\n';
return 0;
}
