//minamoto

 #include<cstdio>

 #include<algorithm>

 #include<iostream>

 #define ll long long

 using namespace std;

 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)

 char buf[<<],*p1=buf,*p2=buf;

 inline int read(){

     #define num ch-'0'

     char ch;bool flag=;int res;

     while(!isdigit(ch=getc()))

     (ch=='-')&&(flag=true);

     for(res=num;isdigit(ch=getc());res=res*+num);

     (flag)&&(res=-res);

     #undef num

     return res;

 }

 char obuf[<<],*o=obuf;

 inline void print(ll x){

     if(x>) print(x/);

     *o++=x%+;

 }

 const int N=;

 int fa[N],ch[N][],s[N],rev[N],top,sum[N],summ[N];

 inline bool isroot(int x){return ch[fa[x]][]!=x&&ch[fa[x]][]!=x;}

 inline void pushup(int x){sum[x]=sum[ch[x][]]+sum[ch[x][]]+summ[x]+;}

 inline void pushdown(int x){

     if(x&&rev[x]){

         swap(ch[x][],ch[x][]);

         rev[ch[x][]]^=,rev[ch[x][]]^=;

         rev[x]=;

     }

 }

 void rotate(int x){

     int y=fa[x],z=fa[y],d=ch[y][]==x;

     if(!isroot(y)) ch[z][ch[z][]==y]=x;

     fa[x]=z,fa[y]=x,fa[ch[x][d^]]=y,ch[y][d]=ch[x][d^],ch[x][d^]=y,pushup(y);

 }

 void splay(int x){

     s[top=]=x;for(int i=x;!isroot(i);i=fa[i]) s[++top]=fa[i];

     while(top) pushdown(s[top--]);

     for(int y=fa[x],z=fa[y];!isroot(x);y=fa[x],z=fa[y]){

         if(!isroot(y))

         ((ch[y][]==x)^(ch[z][]==y))?rotate(x):rotate(y);

         rotate(x);

     }

     pushup(x);

 }

 inline void access(int x){

     for(int y=;x;x=fa[y=x])

     splay(x),summ[x]+=sum[ch[x][]],summ[x]-=sum[ch[x][]=y];

 }

 inline void makeroot(int x){

     access(x),splay(x),rev[x]^=;

 }

 inline void split(int x,int y){

     makeroot(x),access(y),splay(y);

 }

 inline void link(int x,int y){

     split(x,y),summ[fa[x]=y]+=sum[x],pushup(y);

 }

 int main(){

     //freopen("testdata.in","r",stdin);

     int n=read(),m=read();

     for(int i=;i<=n;++i) sum[i]=;

     while(m--){

         char ch;int u,v;

         ch=getc(),u=read(),v=read();

         if(ch=='A') link(u,v);

         else split(u,v),print(1ll*(summ[u]+)*(summ[v]+)),*o++='\n';

         /*split之后splay中肯定只有u,v两点

         然后虚子树中的点数就相当于cut之后两点各自的子树大小

         然后又因为u和v都已经被splay过了，肯定没有点在它上面*/

     }

     fwrite(obuf,o-obuf,,stdout);

     return ;

 }