#include<iostream>
using namespace std ;
const int N = 1e5 + 10 ;
int p[N] ,si[N] ;
int n , m ;
int find(int x)
{
    if(p[x] != x) p[x] = find(p[x]);
    return p[x] ;
}
int main()
{
    cin >> n >> m ;
    for(int i = 1 ; i <= n ; i++)
    {
        p[i]= i ;
        si[i] = 1 ;
    }
    while(m--)
    {
        char op[5] ;
        int a ,b ;
        scanf("%s" , op);
        if(op[0] == 'C')
        {
            cin >> a >> b ;
            if(find(a) == find(b)) continue ;
            si[find(b)] = si[find(b)] + si[find(a)] ;
            p[find(p[a])] = find(p[b]) ;
        }
        else if(op[1] == '1')
        {
            cin >> a >> b ; 
            if(find(a) == find(b))cout << "Yes"<< endl ;
            else cout << "No" << endl ;
        }
        else
        {
            cin >> a ;
            cout << si[find(a)] << endl ;
        }
    }
    return 0 ;
}