#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 100001;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); } 
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modInt {
    T val;
    T mod = 0;
    // static const T mod = MOD;

    void normalize() {
        if (mod == 0) return;
        val %= mod; if (val < 0) val += mod;
    }
    modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
    // modInt(T v = 0, T m = 0) : val(v) { normalize(); }

    explicit operator T() const { return val; }
    friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
    friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
    friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }

    friend void check(modInt& a, modInt& b) { // make sure all operations are valid
        // comment out if mod is static const
        if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
        T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
        if (a.mod != mod) { a.mod = mod; a.normalize(); }
        if (b.mod != mod) { b.mod = mod; b.normalize(); }
    }
    friend modInt operator+(modInt a, modInt b) {
        check(a,b); a.val += (T)b;
        if (a.val >= a.mod) a.val -= a.mod;
        return a;
    }
    friend modInt operator-(modInt a, modInt b) {
        check(a,b); a.val -= (T)b; 
        if (a.val < 0) a.val += a.mod; 
        return a;
    }
    friend modInt operator-(const modInt& a) { return modInt(0)-a; }

    friend modInt operator*(modInt a, modInt b) {
        check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
    }
    friend modInt exp(modInt a, ll p) {
        modInt ans(1,a.mod);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modInt inv(const modInt& a) {
        return {invGeneral(a.val,a.mod),a.mod};
        // return exp(b,b.mod-2) if prime
    }
    friend modInt operator/(modInt a, modInt b) { 
        check(a,b); return a*inv(b); 
    }
};

typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;


template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;

template<class T> T poll(pqg<T>& x) {
    T y = x.top(); x.pop();
    return y;
}

template<int SZ> struct mcf { // assume no negative cycles
    struct Edge { int v, rev; ll flow, cap, cost; };

    vector<Edge> adj[SZ];

    void addEdge(int u, int v, ll cap, ll cost) {
        Edge a{v, sz(adj[v]), 0, cap, cost}, b{u, sz(adj[u]), 0, 0, -cost};
        adj[u].pb(a), adj[v].pb(b);
    }

    int ST, EN;
    pi pre[SZ]; // previous vertex, edge label on path
    pl cost[SZ]; // tot cost of path, amount of flow
    ll totFlow, totCost, curCost;

    void reweight() { // ensures all non-negative edge weights
    	F0R(i,SZ) trav(p,adj[i]) p.cost += cost[i].f-cost[p.v].f;
    }

    bool spfa() { // reweighting will ensure that there will be negative weights only during the first time you run this
        F0R(i,SZ) cost[i] = {INF,0};
        cost[ST] = {0,INF};
        pqg<pair<ll,int>> todo; todo.push({0,ST});

        while (sz(todo)) {
            auto x = poll(todo); if (x.f > cost[x.s].f) continue;
            trav(a,adj[x.s]) if (x.f+a.cost < cost[a.v].f && a.flow < a.cap) {
                pre[a.v] = {x.s,a.rev};
                cost[a.v] = {x.f+a.cost, min(a.cap-a.flow,cost[x.s].s)};
                todo.push({cost[a.v].f,a.v});
            }
        }

        curCost += cost[EN].f; return cost[EN].s;
    }

    void backtrack() {
        auto f = cost[EN].s; totFlow += f, totCost += curCost*f;
        for (int x = EN; x != ST; x = pre[x].f) {
            adj[x][pre[x].s].flow -= f;
            adj[pre[x].f][adj[x][pre[x].s].rev].flow += f;
        }
    }

    pl minCostFlow(int _ST, int _EN) {
        ST = _ST, EN = _EN; totFlow = totCost = curCost = 0;
        spfa();
        while (1) {
            reweight();
            if (!spfa()) return {totFlow, totCost};
            backtrack();
        }
    }
};

ll ans;

int N,M;
vpi L,R,U,D;
vi l,r,d,u;
vector<array<ll,3>> v;

void nor(vpi& v) {
    if (sz(v)) ckmin(v[0].s,N);
    FOR(i,1,sz(v)) ckmin(v[i].s,v[i-1].s);
}

void init() {
    setIO(); re(N);
    v.resz(N); re(v);
    re(M);
    F0R(i,M) {
        char t; int a,b; re(t,a,b);
        switch(t) {
            case 'L': L.pb({a,b});
            break;
            case 'R': R.pb({a,b});
            break;
            case 'U': U.pb({a,b});
            break;
            case 'D': D.pb({a,b});
            break;
        }
    }
    sort(L.rbegin(), L.rend()); nor(L);
    sort(all(R)); nor(R);
    sort(D.rbegin(), D.rend()); nor(D);
    sort(all(U)); nor(U);
}

void test(int num) {
    mcf<322> m;
    FOR(i,1,num+1) {
        m.addEdge(0,i,1,0);
        // ps("HAH",l[i-1],)
        F0R(j,N) if (l[i-1] <= v[j][0] && v[j][0] <= r[num-i]) m.addEdge(i,num+1+j,1,0); // x,y,value
    }
    F0R(i,N) m.addEdge(num+1+i,num+1+i+N,1,-v[i][2]);
    FOR(i,1,num+1) {
        m.addEdge(num+2*N+i,2*N+2*num+1,1,0);
        F0R(j,N) if (d[i-1] <= v[j][1] && v[j][1] <= u[num-i]) m.addEdge(num+N+j+1,num+2*N+i,1,0);
    }
    auto a = m.minCostFlow(0,2*N+2*num+1);
    // ps("HUH",num,a);
    if (a.f != num) {
        cout << ans;
        exit(0);
    }
    ckmax(ans,-a.s);
}

int main() {
    init();
    pi lst = {1,0}; reverse(all(L));
    F0R(i,sz(L)) {
        F0R(j,L[i].s-lst.s) l.pb(lst.f);
        lst = {L[i].f+1,L[i].s};
    }
    F0R(i,N-lst.s) l.pb(lst.f);
    
    lst = {100,0}; reverse(all(R));
    F0R(i,sz(R)) {
        F0R(j,R[i].s-lst.s) r.pb(lst.f);
        lst = {R[i].f-1,R[i].s};
    }
    F0R(i,N-lst.s) r.pb(lst.f);
    
    lst = {1,0}; reverse(all(D));
    F0R(i,sz(D)) {
        F0R(j,D[i].s-lst.s) d.pb(lst.f);
        lst = {D[i].f+1,D[i].s};
    }
    F0R(i,N-lst.s) d.pb(lst.f);
    
    lst = {100,0}; reverse(all(U));
    F0R(i,sz(U)) {
        F0R(j,U[i].s-lst.s) u.pb(lst.f);
        lst = {U[i].f-1,U[i].s};
    }
    F0R(i,N-lst.s) u.pb(lst.f);
    // ps(l,r,d,u);
    FOR(i,1,N+1) test(i);
    ps(ans);
    
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/


Measured memory_bytes: 1272