#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m;
int p[N];

int find(int x)
{
    if (p[x] != x) // 只有祖宗节点的p[x]值等于他自己，p[x] = x
    {
        p[x] = find(p[x]);
    }   
    return p[x];
    // 找到了便返回祖宗节点的值
}
int main()
{
    int n, m;
    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);
        // p[find(b)] = find(a); 都ok，只是放到同一个父节点
        else if (find(a) == find(b))
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}