#include <iostream>
using namespace std;
const int N=100005;
int p[N];
int find(int x)
{
if(x!=p[x])
p[x]=find(p[x]);
return p[x];
}
int main()
{
int n,m;
char op[2];
int a,b;
cin>>n>>m;
for(int i=1; i<=n; i++)
p[i]=i;
while(m--)
{
scanf("%s%d%d",op,&a,&b);
if(op[0]=='M')
{
p[find(a)]=find(b);
}
else
{
if (find(a) == find(b))
puts("Yes");
else
puts("No");
}
}
//cout << "Hello world!" << endl;
return 0;
}