#include"bits/stdc++.h"
#include"ext/pb_ds/tree_policy.hpp"
#include"ext/pb_ds/assoc_container.hpp"
using namespace std;
using namespace __gnu_pbds;
#define FOR(i,a,b)for(int i=a;i<b;i++)
#define F0R(i,a)FOR(i,0,a)
#define ROF(i,a,b)for(int i=b-1;a<=i;i--)
#define R0F(i,a)ROF(i,0,a)
#define rep(a)F0R(_,a)
#define each(a,x)for(auto&a:x)
#define all(a)begin(a),end(a)
#define sz(x)int(size(x))
#define lla(x)rbegin(x),rend(x)
#define SUM(a)accumulate(all(a),0ll)
#define SUMM(a,b)accumulate(a,a+b,0ll)
#define MAX(a)*max_element(all(a))
#define MAXX(a,b)*max_element(a,a+b)
#define MIN(a)*min_element(all(a))
#define MINN(a,b)*min_element(a,a+b)
#define con const int
#define lwb lower_bound
#define upb upper_bound
#define bry binary_search
#ifdef LOCAL
#define print(x)cout<<x;
#else
#define print(...)
#endif
#define debug(x)print(#x<<" = "<<x<<endl)
using ld=long double;
using ll=long long;
using str=string;
template<class T>using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T>using omset=tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T>T minn(T a){return a;}
template<class T,class...Args>T minn(T a,Args... args){return min(a,minn(args...));}
template<class T>T maxx(T a){return a;}
template<class T,class...Args>T maxx(T a,Args... args){return max(a,maxx(args...));}
#define SMIN(a,b...)a=min(a,minn(b))
#define SMAX(a,b...)a=max(a,maxx(b))
void fileset(str a){assert(nullptr!=freopen((a+".in").c_str(),"r",stdin)&&nullptr!=freopen((a+".out").c_str(),"w",stdout));}
con mxN = 2e3 + 3;

vector<tuple<int,int,int>> comps;
vector<tuple<int,int,int>> ordrs;

int vis[mxN][mxN];
ll dp[mxN][mxN];

int N, M;

ll go(int i, int j){
    if (i == N || j == M) {
        return 0;
    }

    if (!vis[i][j]){
        vis[i][j] = 1;

        auto& [c, f, v] = comps[i];
        auto& [C, F, V] = ordrs[j];

        if (f >= F){
            SMAX(dp[i][j], go(i + 1, j + 1) + V - v);
        }

        SMAX(dp[i][j], go(i + 1, j));
        SMAX(dp[i][j], go(i, j + 1));
    }

    return dp[i][j];
}

int main(){
    cin >> N;

    F0R (i, N){
        int c, f, v;
        cin >> c >> f >> v;

        comps.emplace_back(c, f, v);
    }

    cin >> M;

    F0R (i, M){
        int C, F, V;
        cin >> C >> F >> V;

        ordrs.emplace_back(C, F, V);
    }

    sort(all(comps),[](auto& i, auto& j){
        auto& [ci, fi, vi] = i;
        auto& [cj, fj, vj] = j;

        if (fi ^ fj){
            return fi < fj;
        } else {
            return vi < vj;
        }
    });

    sort(all(ordrs),[](auto& i, auto& j){
        auto& [ci, fi, vi] = i;
        auto& [cj, fj, vj] = j;

        if (fi ^ fj){
            return fi < fj;
        } else {
            return vi < vj;
        }
    });

    cout << go(0, 0) << endl;
}