#include<bits/stdc++.h>

using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const int64 infll = (1LL << 61) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename flow_t, typename cost_t >
struct PrimalDual {
  const cost_t INF;

  struct edge {
    int to;
    flow_t cap;
    cost_t cost;
    int rev;
    bool isrev;
  };
  vector< vector< edge > > graph;
  vector< cost_t > potential, min_cost;
  vector< int > prevv, preve;

  PrimalDual(int V) : graph(V), INF(numeric_limits< cost_t >::max()) {}

  void add_edge(int from, int to, flow_t cap, cost_t cost) {
    graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size(), false});
    graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1, true});
  }

  cost_t min_cost_flow(int s, int t, flow_t f) {
    int V = (int) graph.size();
    cost_t ret = 0;
    using Pi = pair< cost_t, int >;
    priority_queue< Pi, vector< Pi >, greater< Pi > > que;
    potential.assign(V, 0);
    preve.assign(V, -1);
    prevv.assign(V, -1);

    while(f > 0) {
      min_cost.assign(V, INF);
      que.emplace(0, s);
      min_cost[s] = 0;
      while(!que.empty()) {
        Pi p = que.top();
        que.pop();
        if(min_cost[p.second] < p.first) continue;
        for(int i = 0; i < graph[p.second].size(); i++) {
          edge &e = graph[p.second][i];
          cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];
          if(e.cap > 0 && min_cost[e.to] > nextCost) {
            min_cost[e.to] = nextCost;
            prevv[e.to] = p.second, preve[e.to] = i;
            que.emplace(min_cost[e.to], e.to);
          }
        }
      }
      if(min_cost[t] == INF) return 0;//return -1;
      for(int v = 0; v < V; v++) potential[v] += min_cost[v];
      flow_t addflow = f;
      for(int v = t; v != s; v = prevv[v]) {
        addflow = min(addflow, graph[prevv[v]][preve[v]].cap);
      }
      f -= addflow;
      ret += addflow * potential[t];
      for(int v = t; v != s; v = prevv[v]) {
        edge &e = graph[prevv[v]][preve[v]];
        e.cap -= addflow;
        graph[v][e.rev].cap += addflow;
      }
    }
    return ret;
  }

  void output() {
    for(int i = 0; i < graph.size(); i++) {
      for(auto &e : graph[i]) {
        if(e.isrev) continue;
        auto &rev_e = graph[e.to][e.rev];
        cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/" << rev_e.cap + e.cap << ")" << endl;
      }
    }
  }
};


int main() {
  int N, M;
  cin >> N;
  vector< int > X(N), Y(N);
  vector< int64 > V(N);
  for(int i = 0; i < N; i++) {
    cin >> X[i] >> Y[i] >> V[i];
    --X[i], --Y[i];
  }
  cin >> M;
  vector< int > L(100, N), R(100, N), D(100, N), U(100, N);
  for(int i = 0; i < M; i++) {
    char t;
    int a, b;
    cin >> t >> a >> b;
    --a;
    if(t == 'L') chmin(L[a], b);
    else if(t == 'R') chmin(R[a], b);
    else if(t == 'D') chmin(D[a], b);
    else chmin(U[a], b);
  }
  for(int i = 98; i >= 0; i--) chmin(L[i], L[i + 1]);
  for(int i = 1; i < 100; i++) chmin(R[i], R[i - 1]);
  for(int i = 98; i >= 0; i--) chmin(D[i], D[i + 1]);
  for(int i = 1; i < 100; i++) chmin(U[i], U[i - 1]);

  int64 ret = 0;
  for(int k = 1; k <= N; k++) {

    auto get_range = [&](vector< int > &P, vector< int > &Q) {
      vector< int > l(N + 2), r(N + 2, inf);
      for(int i = 0; i < P.size(); i++) {
        chmax(l[P[i] + 1], i + 1);
      }
      for(int i = 0; i < Q.size(); i++) {
        if(k - Q[i] > 0) chmin(r[k - Q[i]], i - 1);
      }
      vector< pair< int, int > > ret;
      for(int i = k - 1; i >= 0; i--) {
        chmin(r[i], r[i + 1]);
      }
      for(int i = 1; i <= k; i++) {
        chmax(l[i], l[i - 1]);
        ret.emplace_back(l[i], r[i]);
      }
      return ret;
    };


    auto latte = get_range(L, R);
    auto malta = get_range(D, U);

    PrimalDual< int64, int64 > flow(2 * k + N * 2 + 2);
    int S = 2 * k + 2 * N, T = S + 1;
    for(int i = 0; i < k; i++) {
      flow.add_edge(S, i, 1, 0);
      flow.add_edge(i + k, T, 1, 0);
    }
    for(int i = 0; i < N; i++) {
      for(int j = 0; j < k; j++) {
        if(latte[j].first <= X[i] && X[i] <= latte[j].second) {
          flow.add_edge(j, 2 * k + i, 1, 0);
        }
        if(malta[j].first <= Y[i] && Y[i] <= malta[j].second) {
          flow.add_edge(2 * k + N + i, k + j, 1, 0);
        }
      }
      flow.add_edge(2 * k + i, 2 * k + N + i, 1, -V[i]);
    }
    chmax(ret, -flow.min_cost_flow(S, T, k));
  }
  cout << ret << endl;
}





Measured memory_bytes: 1260