#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const int N=1e5+5;
int n,q,now[N],val[N];
bool G[N][4];
struct Set{
	priority_queue<pair<int,int> >A,B;
	void clear(){
		priority_queue<pair<int,int> >().swap(A);
		priority_queue<pair<int,int> >().swap(B);
	}
	void insert(pair<int,int>x){A.push(mk(-x.fi,x.se));}
	void erase(pair<int,int>x){B.push(mk(-x.fi,x.se));}
	pair<int,int> top(){
		while(B.size()&&A.top()==B.top())A.pop(),B.pop();
		auto res=A.top();return mk(-res.fi,res.se);
	}
	int size(){return A.size()-B.size();}
}R[4],P[4],Q[4][4];

void ins(int x){
	if(now[x]==-1){
		for(int i=0;i<4;i++)if(G[x][i])P[i].insert(mk(val[x],x));
	}
	else R[now[x]].insert(mk(-val[x],x));
	if(now[x]!=-1){
		for(int i=0;i<4;i++)if(i!=now[x]&&G[x][i])Q[now[x]][i].insert(mk(0,x));
	}
}
void del(int x){
	if(now[x]==-1){
		for(int i=0;i<4;i++)if(G[x][i])P[i].erase(mk(val[x],x));
	}
	else R[now[x]].erase(mk(-val[x],x));
	if(now[x]!=-1){
		for(int i=0;i<4;i++)if(i!=now[x]&&G[x][i])Q[now[x]][i].erase(mk(0,x));
	}
}

void argu1(int i){ // s -> L[x] -> R[i]
	int x=P[i].top().se;
	del(x),now[x]=i,ins(x);
//	cout<<"  argu1 s -> L"<<x<<" -> R"<<i<<endl;
//	cout<<"  now = ";for(int i=1;i<=n;i++)cout<<now[i]<<" ";puts("");
}
void argu2(int i,int j){ // R[i] -> L[x] -> R[j]
	int x=Q[i][j].top().se;
	del(x),now[x]=j,ins(x);
//	cout<<"  argu2 R"<<i<<" -> L"<<x<<" -> R"<<j<<endl;
//	cout<<"  now = ";for(int i=1;i<=n;i++)cout<<now[i]<<" ";puts("");
}
void argu3(int i){ // R[i] -> L[x] -> s
	int x=R[i].top().se;
	del(x),now[x]=-1,ins(x);
//	cout<<"  argu3 R"<<i<<" -> L"<<x<<" -> s"<<endl;
//	cout<<"  now = ";for(int i=1;i<=n;i++)cout<<now[i]<<" ";puts("");
}

signed main(void){

#ifndef ONLINE_JUDGE
//	freopen("in.in","r",stdin);
	freopen("q.in","r",stdin);
#endif

	n=read();
	for(int i=1;i<=n;i++){
		vector<int>vis(3);auto gv=[&](char c){if(c=='D')return 0;if(c=='S')return 1;return 2;};
		char c=getchar();while(c=='D'||c=='B'||c=='S')vis[gv(c)]=1,c=getchar();
		G[i][0]=vis[0],G[i][1]=vis[1],G[i][2]=vis[2],G[i][3]=(vis[0]|vis[1]),val[i]=read();
	}
	
	const ll INF=1e18;
	vector<vector<ll> >v(6,vector<ll>(6,INF));
	auto SP=[&](int s,int t){
		vector<vector<int> >pre(6,vector<int>(6,0));auto f=v;
		
		for(int i=0;i<6;i++)f[i][i]=0;
		for(int k=0;k<6;k++)for(int i=0;i<6;i++)for(int j=0;j<6;j++){
			if(f[i][k]+f[k][j]<f[i][j])f[i][j]=f[i][k]+f[k][j],pre[i][j]=k;
		}
		
		vector<int>path;
		function<void(int,int)>get_path=[&](int x,int y){
			if(v[x][y]==f[x][y])return path.emplace_back(x),void();
			int p=pre[x][y];get_path(x,p),get_path(p,y);
		};
		get_path(s,t);path.emplace_back(t);
		
		return mk(f[s][t],path);
	};
	auto clr=[&](){for(int i=0;i<6;i++)for(int j=0;j<6;j++)v[i][j]=INF;};
	
	for(int i=1;i<=n;i++)now[i]=-1,ins(i);
	
	ll ans=0;
	while(true){
		int chk=-2;ll cur=0;
//		puts("new team");
		for(int x=0;x<4;x++){
			for(int i=0;i<4;i++)for(int j=0;j<4;j++)if(Q[i][j].size())v[i][j]=0;
			for(int i=0;i<4;i++)if(P[i].size())v[4][i]=P[i].top().fi;
			v[x][5]=0;auto [cost,path]=SP(4,5);clr();
//			cout<<" argument path = ";for(int x:path)cout<<x<<" ";cout<<"cost = "<<cost<<endl;
			if(cost>=INF){chk=x-1;break;}
			argu1(path[1]);int k=path.size();assert(k>=3);
			for(int i=1;i<=k-3;i++)argu2(path[i],path[i+1]);
			cur+=cost;
		}
//		cout<<"now = ";for(int i=1;i<=n;i++)cout<<now[i]<<" ";puts("");
		if(chk==-2){ans+=cur;continue;}
		for(int x=chk;x>=0;x--){
			for(int i=0;i<4;i++)for(int j=0;j<4;j++)if(Q[i][j].size())v[i][j]=0;
			for(int i=0;i<4;i++)if(R[i].size())v[i][4]=R[i].top().fi;
			v[5][x]=0;auto [cost,path]=SP(5,4);clr();
//			cout<<" argument path = ";for(int x:path)cout<<x<<" ";cout<<"cost = "<<cost<<endl;
			
			int k=path.size();assert(k>=3);
			for(int i=1;i<=k-3;i++)argu2(path[i],path[i+1]);
			argu3(path[k-2]);
		}
		break;
	}
	
//	cout<<"now ans = "<<ans<<endl;
//	cout<<"now = ";for(int i=1;i<=n;i++)cout<<now[i]<<" ";puts("");
	
	q=read();
	for(int _=1;_<=q;_++){
		int x=read(),w=read();
		if(now[x]!=-1)ans+=w-val[x];
		del(x),val[x]=w,ins(x);
//		cout<<"now ans = "<<ans<<endl;
		for(int y=0;y<4;y++)if(P[y].size()){
//			cout<<" y = "<<y<<" len = "<<P[y].top().fi<<endl;
			for(int i=0;i<4;i++)for(int j=0;j<4;j++)if(Q[i][j].size())v[i][j]=0;
			for(int i=0;i<4;i++)if(R[i].size())v[i][4]=R[i].top().fi;
			auto [cost,path]=SP(y,4);clr();
//			cout<<" argument path = ";for(int x:path)cout<<x<<" ";cout<<"cost = "<<cost<<endl;
			if(cost+P[y].top().fi>=0)continue;
			ans+=cost+P[y].top().fi;
			argu1(y);int k=path.size();assert(k>=2);
			for(int i=0;i<=k-3;i++)argu2(path[i],path[i+1]);
			argu3(path[k-2]);
		}
//		cout<<"now = ";for(int i=1;i<=n;i++)cout<<now[i]<<" ";puts("");
		cout<<ans<<'\n';
	}

	return 0;
}