#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
//mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const ll INF = 1e18 + 69;
struct SegmentTree{
int n;
vector<ll> a, lazy;
SegmentTree(int _n){
n = _n;
a.resize(n * 4 + 4, -INF);
lazy.resize(n * 4 + 4);
}
void apply(int id, ll val){
a[id] += val;
lazy[id] += val;
}
void down(int id){
apply(id * 2, lazy[id]);
apply(id * 2 + 1, lazy[id]);
lazy[id] = 0;
}
void update(int u, int v, ll val, int l, int r, int id){
if (u <= l && r <= v){
apply(id, val);
return;
}
if (lazy[id]) down(id);
int mid = (l + r) >> 1;
if (u <= mid) update(u, v, val, l, mid, id * 2);
if (v > mid) update(u, v, val, mid + 1, r, id * 2 + 1);
a[id] = max(a[id * 2], a[id * 2 + 1]);
}
void update(int l, int r, ll val){
update(l, r, val, 1, n, 1);
}
void ass(int i, ll val, int l, int r, int id){
if (l == r){
maximize(a[id], val);
return;
}
if (lazy[id]) down(id);
int mid = (l + r) >> 1;
if (i <= mid) ass(i, val, l, mid, id * 2);
else ass(i, val, mid + 1, r, id * 2 + 1);
a[id] = max(a[id * 2], a[id * 2 + 1]);
}
void ass(int i, ll val){
ass(i, val, 1, n, 1);
}
ll get(int u, int v, int l, int r, int id){
if (u <= l && r <= v) return a[id];
if (lazy[id]) down(id);
int mid = (l + r) >> 1;
ll ans = -INF;
if (u <= mid) maximize(ans, get(u, v, l, mid, id * 2));
if (v > mid) maximize(ans, get(u, v, mid+1, r, id * 2 + 1));
return ans;
}
ll get(int l, int r){
return get(l, r, 1, n, 1);
}
};
void solve(){
int n, m; cin >> n >> m;
vector<ll> a(n+1), s(n+1), p(n+1);
vector<ll> b(m+1), t(m+1), q(m+1);
for(int i = 1; i <= n; ++i) cin >> a[i] >> s[i] >> p[i];
for(int i = 1; i <= m; ++i) cin >> b[i] >> t[i] >> q[i];
vector<int> r1(n+1), r2(m+1);
for(int i = 1; i <= n; ++i) a[i] += a[i-1];
for(int i = 1; i <= m; ++i) b[i] += b[i-1];
for(int i = 1; i <= n; ++i){
r1[i] = upper_bound(ALL(b), s[i] - a[i]) - b.begin();
}
for(int i = 1; i <= m; ++i){
r2[i] = upper_bound(ALL(a), t[i] - b[i]) - a.begin();
}
vector<vector<int>> pos(m+2);
for(int i = 1; i <= n; ++i) pos[r1[i]].push_back(i);
SegmentTree st(n+2);
st.ass(n+1, 0);
for(int i = m; i >= 0; --i){
for(int j: pos[i+1]){
st.update(j+1, n+1, p[j]);
}
if (i == 0) break;
if (r2[i] > 0){
ll val = st.get(r2[i]+1, n+1);
st.ass(r2[i], val);
st.update(1, r2[i], q[i]);
}
}
ll ans = st.get(1, n+1);
cout << ans << "\n";
}
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << "ms!\n";
return 0;
}
