/**
 *    author:  tourist
 *    created: 19.01.2020 03:02:31       
**/
#include <bits/stdc++.h>

using namespace std;

template <typename T, typename C>
class mcmf {
 public:
  static constexpr T eps = (T) 1e-9;

  struct edge {
    int from;
    int to;
    T c;
    T f;
    C cost;
  };

  vector<vector<int>> g;
  vector<edge> edges;
  vector<C> d;
  vector<int> q;
  vector<bool> in_queue;
  vector<int> pe;
  int n;
  int st, fin;
  T flow;
  C cost;

  mcmf(int _n, int _st, int _fin) : n(_n), st(_st), fin(_fin) {
    assert(0 <= st && st < n && 0 <= fin && fin < n && st != fin);
    g.resize(n);
    d.resize(n);
    in_queue.resize(n);
    pe.resize(n);
    flow = 0;
    cost = 0;
  }

  void clear_flow() {
    for (const edge &e : edges) {
      e.f = 0;
    }
    flow = 0;
  }
   
  void add(int from, int to, T forward_cap, T backward_cap, C cost) {
    assert(0 <= from && from < n && 0 <= to && to < n);
    g[from].push_back((int) edges.size());
    edges.push_back({from, to, forward_cap, 0, cost});
    g[to].push_back((int) edges.size());
    edges.push_back({to, from, backward_cap, 0, -cost});
  }

  bool expath() {
    fill(d.begin(), d.end(), numeric_limits<C>::max());
    q.clear();
    q.push_back(st);
    d[st] = 0;
    in_queue[st] = true;
    int beg = 0;
    bool found = false;
    while (beg < (int) q.size()) {
      int i = q[beg++];
      if (i == fin) {
        found = true;
      }
      in_queue[i] = false;
      for (int id : g[i]) {
        const edge &e = edges[id];
        if (e.c - e.f > eps && d[i] + e.cost < d[e.to]) {
          d[e.to] = d[i] + e.cost;
          pe[e.to] = id;
          if (!in_queue[e.to]) {
            q.push_back(e.to);
            in_queue[e.to] = true;
          }
        }
      }
    }
    if (found) {
      T push = numeric_limits<T>::max();
      int v = fin;
      while (v != st) {
        const edge &e = edges[pe[v]];
        push = min(push, e.c - e.f);
        v = e.from;
      }
      v = fin;
      while (v != st) {
        edge &e = edges[pe[v]];
        e.f += push;
        edge &back = edges[pe[v] ^ 1];
        back.f -= push;
        v = e.from;
      }
      flow += push;
      cost += push * d[fin];
    }
    return found;
  }
   
  pair<T, C> max_flow_min_cost() {
    while (expath()) {}
    return {flow, cost};
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> x(n), y(n);
  vector<long long> v(n);
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i] >> v[i];
  }
  int m;
  cin >> m;
  vector<char> t(m);
  vector<int> a(m), b(m);
  for (int i = 0; i < m; i++) {
    cin >> t[i] >> a[i] >> b[i];
  } 
  long long ans = 0;
  for (int k = 1; k <= n; k++) {
    vector<int> lx(k, 1), rx(k, 100);
    vector<int> ly(k, 1), ry(k, 100);
    for (int i = 0; i < m; i++) {
      if (b[i] >= k) {
        continue;
      }
      if (t[i] == 'L') {
        lx[b[i]] = max(lx[b[i]], a[i] + 1);
      }
      if (t[i] == 'D') {
        ly[b[i]] = max(ly[b[i]], a[i] + 1);
      }
      if (t[i] == 'R') {
        rx[k - 1 - b[i]] = min(rx[k - 1 - b[i]], a[i] - 1);
      }
      if (t[i] == 'U') {
        ry[k - 1 - b[i]] = min(ry[k - 1 - b[i]], a[i] - 1);
      }
    }
    for (int i = 0; i < k - 1; i++) {
      lx[i + 1] = max(lx[i + 1], lx[i]);
      ly[i + 1] = max(ly[i + 1], ly[i]);
    }
    for (int i = k - 1; i > 0; i--) {
      rx[i - 1] = min(rx[i - 1], rx[i]);
      ry[i - 1] = min(ry[i - 1], ry[i]);
    }
    mcmf<int, long long> f(1 + k + n + n + k + 1, 0, 1 + k + n + n + k);
    for (int i = 0; i < k; i++) {
      f.add(0, 1 + i, 1, 0, 0);
      for (int j = 0; j < n; j++) {
        if (lx[i] <= x[j] && x[j] <= rx[i]) {
          f.add(1 + i, 1 + k + j, 1, 0, 0);
        }
        if (ly[i] <= y[j] && y[j] <= ry[i]) {
          f.add(1 + k + n + j, 1 + k + n + n + i, 1, 0, 0);
        }
      }
      f.add(1 + k + n + n + i, 1 + k + n + n + k, 1, 0, 0);
    }
    for (int i = 0; i < n; i++) {
      f.add(1 + k + i, 1 + k + n + i, 1, 0, -v[i]);
    }
    auto p = f.max_flow_min_cost();
    if (p.first == k) {
      ans = max(ans, -p.second);
    }
  }
  cout << ans << '\n';
  return 0;
}


Measured memory_bytes: 1512