并查集模板题，关键是find函数，当前节点不是根节点时，让它指向祖宗节点
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int n,m;
int p[N];

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 == 'M')  p[find(a)] = find(b);
        else{
            if(find(a) == find(b))  puts("Yes");
            else    puts("No");
        }
    }
    return 0;
}