#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+50,M=10000,inf=1e9+7;

int n,num[8],c[N],k,b[N],p[N],mpp[8],m,dfn[N];
ll ans;
map<string,int>mp;
string s[N];

struct edge
{
	int v,w,nxt;
};

struct flows
{
    int head[M],cnt=1,st,ed,ans,dep[M],cur[M];
    edge e[M];vector<int>eg;

    void add(int u,int v,int w)
    {
        e[++cnt]=(edge){v,w,head[u]};head[u]=cnt;
        e[++cnt]=(edge){u,0,head[v]};head[v]=cnt;
    }

    int bfs()
    {
        queue<int>q;
        for(int i=1;i<=ed;i++)dep[i]=0;
        dep[st]=1,q.push(st);
        while(!q.empty())
        {
            int u=q.front();q.pop();
            for(int i=head[u];i;i=e[i].nxt)
            {
                int v=e[i].v;
                if(!dep[v]&&e[i].w>0)
                q.push(v),dep[v]=dep[u]+1;
            }
        }
        return dep[ed];
    }

    int dfs(int now,int flow)
    {
        if(now==ed||!flow)return flow;
        int res=0;
        for(int &i=cur[now];i;i=e[i].nxt)
        {
            int v=e[i].v;	
            if(dep[v]==dep[now]+1&&e[i].w>0)
            {
                int x=dfs(v,min(flow-res,e[i].w));
                if(x>0)
                {
                    e[i].w-=x;e[i^1].w+=x;res+=x;
                    if(flow==res)return res;
                }
            }
        }
        return res;
    }

    void dinic()
    {
        while(bfs()>0)
        {
            for(int i=1;i<=ed;i++)cur[i]=head[i];
            ans+=dfs(st,inf);
        }
    }

    int sol()
    {
        st=12;ed=13;
        for(int i=1;i<=7;i++)add(st,i,num[i]);
        for(int i=8;i<=11;i++)eg.push_back(cnt+1),add(i,ed,0);
        for(int i=2;i<=7;i++)add(i,8,inf);
        add(1,11,inf);add(2,10,inf);add(3,9,inf);
        add(4,11,inf);add(4,10,inf);
        add(5,11,inf);add(5,9,inf);
        add(6,10,inf);add(6,9,inf);
        add(7,11,inf);add(7,10,inf);add(7,9,inf);
        for(int i=1;i<=n;i++)
        {
            for(auto x:eg)++e[x].w;dinic();
            if(ans!=4*i)return i-1;
        }
        return 114514;
    }
}FLOWS;

struct poi
{
    int w,x,tim;

    friend bool operator<(poi a,poi b)
    {
        return a.w>b.w;
    }
};

struct node
{
    queue<int>to[7];int w,ty;
    priority_queue<poi>q,rub;

    void pop()
    {
        while(!q.empty()&&(b[q.top().x]||q.top().tim!=dfn[q.top().x]))q.pop();
    }

    poi cost()
    {
        pop();return q.empty()?(poi){inf}:q.top();
    }

    void popto()
    {
        for(int i=1;i<=4;i++)while(!to[i].empty()&&b[to[i].front()]!=ty)to[i].pop();
    }

    void rubpop()
    {
        while(!rub.empty()&&(b[rub.top().x]!=ty||rub.top().tim!=dfn[rub.top().x]))rub.pop();
    }

    void push(poi x)
    {
        ans+=x.w;b[x.x]=ty;w++;
        for(int i=0;i<3;i++)if(p[x.x]&(1<<i))to[4-i].push(x.x);
        if(p[x.x]!=1)to[1].push(x.x);
    }
}q[6];

void insert(int f=0)
{
    int ty=0;poi c1=(poi){inf,0};
    for(int i=1;i<=4;i++)if(q[i].w<k)
    {
        poi w=q[i].cost();
        if(w.w<c1.w)c1=w,ty=i;
    }
    int st=0,ed=0;poi c2=(poi){inf,0};
    for(int i=1;i<=4;i++)if(q[i].w==k)
    {
        poi w=q[i].cost();q[i].popto();
        if(w.w>=c2.w)continue;
        for(int j=1;j<=4;j++)if(i!=j&&q[j].w!=k&&!q[i].to[j].empty())
        {
            st=i,ed=j;c2=w;
            break;
        }
    }
    if(c1.w<=c2.w)
    {
        q[ty].push(c1);
        if(f)q[ty].rub.push((poi){-c1.w,c1.x,dfn[c1.x]});
        return;
    }
    int x=q[st].to[ed].front();
    q[st].push(c2);q[ed].push((poi){0,x});--q[st].w;
    if(f)q[st].rub.push((poi){-c2.w,c2.x,dfn[c2.x]});
    if(f)q[ed].rub.push((poi){-c[x],x,dfn[x]});
}

void add(int i)
{
    for(int j=0;j<3;j++)if(p[i]&(1<<j))q[4-j].q.push((poi){c[i],i,dfn[i]});
    if(p[i]!=1)q[1].q.push((poi){c[i],i,dfn[i]});
}

void init()
{
    k=FLOWS.sol();
    for(int i=1;i<=n;i++)add(i);
    for(int i=1;i<=4;i++)q[i].ty=i;
    for(int fl=1;fl<=4*k;fl++)insert();
}

void del(int x,int w)
{
    ans-=c[x];c[x]=w;
    --q[b[x]].w;b[x]=0;
    add(x);
}

main()
{
    // freopen("in.txt","r",stdin);
    mp["B"]=1;mp["D"]=2;mp["S"]=3;mp["BD"]=4;mp["BS"]=5;mp["DS"]=6;mp["BDS"]=7;
    mpp[1]=1;mpp[2]=2;mpp[3]=4;mpp[4]=3;mpp[5]=5;mpp[6]=6;mpp[7]=7;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>s[i]>>c[i],sort(s[i].begin(),s[i].end()),++num[mp[s[i]]],p[i]=mpp[mp[s[i]]];
    cin>>m;m--;
    int x,val;cin>>x>>val;c[x]=val;
    init();
    cout<<ans<<'\n';
    // cout<<k<<'\n';
    for(int i=1;i<=n;i++)if(b[i])q[b[i]].rub.push((poi){-c[i],i,0});
    while(m--)
    {
        int x,val;
        cin>>x>>val;dfn[x]++;
        // cout<<b[x]<<'\n';
        if(b[x])
        {
            del(x,val);insert(1);
            cout<<ans<<'\n';
            continue;
        }
        c[x]=val;add(x);
        for(int i=1;i<=4;i++)
        {
            // cout<<q[i].rub.size()<<'\n';
            q[i].rubpop();
            del(q[i].rub.top().x,-q[i].rub.top().w);
        }
        for(int i=1;i<=4;i++)insert(1);
        cout<<ans<<'\n';
    }
}