#include <bits/stdc++.h>

using namespace std;

const int N = 100010;

int p[N], siz[N];

int find(int x)
{
    if(p[x] != x) p[x] = find(p[x]);
    return p[x];
}
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; i ++) 
    {
        p[i] = i;
        siz[i] = 1;
    }
    while(m --)
    {
        char op[5];
        int a, b;
        scanf("%s", op);
        if(op[0] == 'C') 
        {
            scanf("%d%d", &a, &b);
            if(find(a) == find(b)) continue;
            siz[find(b)] += siz[find(a)];//在合并两个树时, 先让b树加上a树的点的数量
            p[find(a)] = find(b);
        }
        else if(op[1] == '1')
        {
            scanf("%d%d", &a, &b);
            if(find(a) == find(b)) cout << "Yes" << endl;
            else cout << "No" << endl;
        }
        else 
        {
            scanf("%d", &a);
            cout << siz[find(a)] << endl;
        }

    }
    return 0;
}