#include <iostream>

using namespace std;

const  int N = 1e5 + 9;

int p[N], n , m;

//返回 x 的祖宗节点(路径压缩过)
int find(int x){
   if(p[x] != x) p[x] = find(p[x]);
    return p[x];
}

int main(){
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= n; i++) p[i] = i;

    while(m--){
        char op[2];
        int a,b;
        scanf("%s%d%d",op,&a,&b);

        if(op[0] == 'M')   p[find(a)] = find(b);
        else
            if(find(a) == find(b))    printf("Yes\n");
            else   printf("No\n");
    }
    return 0;
}