#include<bits/stdc++.h>

using namespace std;

const int N=+;

const int M=+;

const int INF=0x3f3f3f3f;

int n,m,r,c,s,t,maxflow,mincost;

int nx,ny,x[N],y[N],xx[N],yy[N],bx[N],by[N];

struct edge{

    int nxt,to,cap,cost;

}edges[M<<];

int cnt=,head[N],pre[N];

struct dat{ int t,l; } R[M],C[M];

bool cmp(dat a,dat b) { return a.l<b.l || a.l==b.l && a.t<b.t; }

void add_edge(int x,int y,int z,int c) {

    edges[++cnt].nxt=head[x]; edges[cnt].to=y; edges[cnt].cap=z; edges[cnt].cost=c; head[x]=cnt;

}

queue<int> q;

int dis[N],lim[N];

bool inq[N];

bool spfa(int s,int t) {

    while (!q.empty()) q.pop();

    memset(dis,0x3f,sizeof(dis));

    memset(inq,,sizeof(inq));

    dis[s]=; inq[s]=; lim[s]=INF; q.push(s);

    while (!q.empty()) {

        int x=q.front(); q.pop();

        for (int i=head[x];i;i=edges[i].nxt) {

            edge e=edges[i];

            if (e.cap && dis[x]+e.cost<dis[e.to]) {

                dis[e.to]=dis[x]+e.cost;

                pre[e.to]=i;  //即e.to这个点是从i这条边来的

                lim[e.to]=min(lim[x],e.cap);

                if (!inq[e.to]) { q.push(e.to); inq[e.to]=; }

            }

        }

        inq[x]=;

    }

    return !(dis[t]==INF);

}

void MCMF() {

    maxflow=; mincost=;

    while (spfa(s,t)) {

        int now=t;

        maxflow+=lim[t];

        mincost+=lim[t]*dis[t];

        while (now!=s) {

            edges[pre[now]].cap-=lim[t];

            edges[pre[now]^].cap+=lim[t];

            now=edges[pre[now]^].to;

        }

    }

}

int main()

{

    scanf("%d",&n);

    for (int i=;i<=n;i++) scanf("%d%d",&x[i],&y[i]),bx[i]=x[i],by[i]=y[i];

    nx=ny=n;

    scanf("%d",&m);

    char opt[];

    for (int i=;i<=m;i++) {

        int tx,ty; scanf("%s%d%d",opt,&tx,&ty);

        if (opt[]=='R') R[++r]=(dat){tx,ty};

        if (opt[]=='C') C[++c]=(dat){tx,ty};

    }

    int tmp=;

    sort(R+,R+r+,cmp);

    for (int i=;i<=r;i++)  //排除行无用限制

        if (tmp== || R[i].t<R[tmp].t) R[++tmp]=R[i],bx[++nx]=R[i].t;

    r=tmp; tmp=;

    sort(C+,C+c+,cmp);

    for (int i=;i<=c;i++)  //排除列无用限制

        if (tmp== || C[i].t<C[tmp].t) C[++tmp]=C[i],by[++ny]=C[i].t;

    c=tmp;

    sort(bx+,bx+nx+); nx=unique(bx+,bx+nx+)-(bx+);  //离散化

    sort(by+,by+ny+); ny=unique(by+,by+ny+)-(by+);  //离散化 

    for (int i=;i<=n;i++) {

        int tx=lower_bound(bx+,bx+nx+,x[i])-bx;

        int ty=lower_bound(by+,by+ny+,y[i])-by;

        add_edge(tx,nx++ty,,-i); add_edge(nx++ty,tx,,i);  //棋子连边

    }

    memset(xx,0x3f,sizeof(xx));

    memset(yy,0x3f,sizeof(yy));

    for (int i=;i<=r;i++) {

        int tx=lower_bound(bx+,bx+nx+,R[i].t)-bx;

        xx[tx]=min(xx[tx],R[i].l);  //先求好限制条件,xx[i]代表i行及以后的最小限制

    }

    for (int i=;i<=c;i++) {

        int ty=lower_bound(by+,by+ny+,C[i].t)-by;

        yy[ty]=min(yy[ty],C[i].l);  //列同行同理

    }

    //这里是关键：行i-1->i为了限制i的出流，列i->i-1为了限制i的出流

    for (int i=;i<=nx;i++) add_edge(i-,i,xx[i],),add_edge(i,i-,,);

    for (int i=;i<=ny;i++) add_edge(nx++i,nx++i-,yy[i],),add_edge(nx++i-,nx++i,,);

    s=; t=nx+;

    MCMF();

    cout<<-mincost<<endl;

    return ;

}