#include<iostream>
using namespace std;
int father[100010],d[100010],i,j,n,m,x,y;
char xc;
int find(int x){//查找的同时合并关系---【并查集】
    if(father[x]==x) return x;
    return father[x]=find(father[x]);
}
void unite(int x,int y){  //集合归并
    int rx=find(x);
    int ry=find(y);
    if(rx!=ry){
        father[ry]=rx;
        d[rx]+=d[ry];
    }
}
int main(){
    cin.tie(nullptr);    //实现 scanf 效率------OK
    cin>>n>>m;
    for(i=1;i<=n;++i){
        father[i]=i;
        d[i]=1;
    }
    for(i=0;i<m;++i){
        cin>>xc;
        if(xc=='M'){
            cin>>x>>y;
            unite(x,y);
        }
        if(xc=='Q'){
            cin>>x;
            printf("%d\n",d[find(x)]);
        }
    }
    return 0;
}//网 pass