#include<bits/stdc++.h>
using namespace std;#definedbdouble#definelllonglong#definePirpair<int,int>#definefifirst#definesesecond#definepbpush_back#definem_pmake_pair#defineinf0x3f3f3f3f#defineINF0x3f3f3f3f3f3f3f3f/*==========ACMer===========*/constint N =1e5+10;int fa[N];intfind(int x){
if(fa[x]== x)return x;return fa[x]=find(fa[x]);}intmain(){
int n, m;scanf("%d %d ",&n,&m);for(int i =1; i <= n; i ++) fa[i]= i;char ch;int x, y;while(m --){
scanf("%c %d %d ",&ch,&x,&y);if(ch =='M'){
int fx =find(x);int fy =find(y);if(fx != fy){
fa[fx]= fy;}}else{
int fx =find(x);int fy =find(y);if(fx == fy)printf("Yes\n");elseprintf("No\n");}}return0;}