#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto&a:v)
#define sz(a) a.size()
typedef long double ld;
using namespace std;
const long long inf = 1e15;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
cin.sync_with_stdio(false);
ll n, m;
cin >> n;
vector<pair<pair<ll, ll>, pair<ll, ll>>> v(n);
rep(i, 0, n) {
cin >> v[i].second.first >> v[i].first.first >> v[i].second.second;
v[i].first.first *= -1;
}
cin >> m;
v.resize(n + m);
rep(i, n, n + m) {
cin >> v[i].second.first >> v[i].first.first >> v[i].second.second;
v[i].first.first *= -1;
v[i].first.second = 1;
}
sort(all(v));
vector<ll>dp(3e5, -inf);
dp[0] = 0;
vector<ll> dp0 = dp;
ll sumc = 1;
rep(i, 0, n + m) {
if (!v[i].first.second) {
rep(j, 0, sumc) if (dp0[j] != -inf)dp[v[i].second.first + j] = max(dp0[v[i].second.first + j], dp0[j] - v[i].second.second);
}
else {
rep(j, v[i].second.first, sumc)if (dp0[j] != -inf)dp[-v[i].second.first + j] = max(dp0[-v[i].second.first + j], dp0[j] + v[i].second.second);
}
sumc += v[i].second.first;
dp0 = dp;
}
ll ans = 0;
rep(i, 0, 3e5)ans = max(dp[i], ans);
cout << ans;
return 0;
}
