#include <iostream>
using namespace std;
const int N = 100010;
int parent[N];
int n, m;
void init(){
    for(int i = 0; i < n; i ++ ){
        parent[i] = i;
    }
}
// 路径压缩
int find(int t){
    if(parent[t] == t)  return t;
    return parent[t] = find(parent[t]);
}

int main(){
    cin >> n >> m;
    init();
    char op;
    int a, b;
    while(m -- ){
        cin >> op >> a >> b;
        if(op == 'M'){
            parent[find(a)] = find(b);
        }else{
            if(find(a) == find(b))  cout << "Yes" << endl;
            else    cout << "No" << endl;
        }
    }
    return 0;
}