#include<bits/stdc++.h>
#define ll long long
#define N 200001
using namespace std;
int n,a[N],fa[N],m,c[N],s[N],vv,ans[N][3],p;
char v;
vector<int> b[N];
int find(int x){
	if(fa[x]==x) return x;
	return fa[x]=find(fa[x]);
}
void merge(int x,int y){
	int u=find(x),v=find(y);
	if(u==v) return ;
	fa[v]=u;
	s[u]+=s[v];
	return ;
}
int main(){
	freopen("COW.in","r",stdin);
	freopen("COW.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    cin>>m;
    for(int i=1;i<=m;i++){
    	cin>>c[i]>>v;
    	if(v=='C') vv=0;
    	else if(v=='O') vv=1;
    	else vv=2;
    	b[c[i]].push_back(vv);
	}
	for(int i=1;i<=n;i++){
		fa[i]=i;
		s[i]=1;
	}
	for(int i=1;i<=n;i++)
	if(b[i].empty()) merge(a[i],i);
	for(int i=1;i<=n;i++)
	if(i==find(i)&&!b[i].empty()) ans[m][b[i].back()]+=s[i];
	for(int i=m;i>0;i--){
		for(int j=0;j<3;j++) ans[i-1][j]=ans[i][j];
		if(!b[c[i]].empty()){
			ans[i-1][b[c[i]].back()]-=s[c[i]];
			b[c[i]].pop_back();
		}
		if(!b[c[i]].empty()) ans[i-1][b[c[i]].back()]+=s[c[i]];
		else{
			p=find(a[c[i]]);
			merge(p,c[i]);
			if(!b[p].empty()) ans[i-1][b[p].back()]+=s[c[i]];
		}
	}
	for(int i=1;i<=m;i++) cout<<ans[i][0]<<' '<<ans[i][1]<<' '<<ans[i][2]<<endl;
    return 0;
}