#include<cstdio>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
using namespace std;
const int maxn=10000+10;
int F[maxn],n,m;
void Clear_List()
{
    rep(i,n)F[i]=i;
}
int Find_Root(int u)
{
    while(u!=F[u])u=F[u];
    return u;
}
bool Query(int u,int v)
{
    return Find_Root(u)==Find_Root(v);
}
void Mark_Root(int u)
{
    int v=F[u],t;F[u]=u;
    while(u!=v)
    {
        t=F[v];F[v]=u;
        u=v;v=t;
    }
}
void Connect(int u,int v)
{
    Mark_Root(u);
    Mark_Root(v);
    F[v]=u;
}
void Destroy(int u,int v)
{
    Mark_Root(u);
    F[v]=v;
}
char c[100];
int main()
{
    //freopen("in","r",stdin);
    scanf("%d%d",&n,&m);int u,v;
    Clear_List();
    rep(i,m)
    {
        scanf(" ");scanf("%s%d%d",c,&u,&v);
        u--;v--;
        switch(c[0])
        {
            case 'Q':Query(u,v)?puts("Yes"):puts("No");break;
            case 'C':Connect(u,v);break;
            case 'D':Destroy(u,v);break;
        }
    }
}

#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;

#define rep(i,a,b) for (int i=(a);i<=(b);i++)
#define per(i,a,b) for (int i=(a);i>=(b);i--)

const int N=16384;
const int L=16;

int n,m;
char s[L];

int c[N][2]; int fa[N];
int rev[N];
int st[N],top;

int rd(void) {
    int x=0,f=1; char c=getchar();
    for (;!isdigit(c);c=getchar()) if (c=='-') f=-1;
    for (;isdigit(c);c=getchar()) x=x*10+c-'0';
    return x*f;
}

int IsRoot(int x) {
    int pre=fa[x];
    return c[pre][0]!=x&&c[pre][1]!=x;
}

void Clear(int x) {
    if (rev[x]) {
        rev[x]^=1;
        rev[c[x][0]]^=1;
        rev[c[x][1]]^=1;
        swap(c[x][0],c[x][1]);
    }
}

void Rotate(int x) {
    int y=fa[x],z=fa[y],l,r;
    if (c[y][0]==x) l=0; else l=1; r=l^1;
    if (!IsRoot(y)) {
        if (c[z][0]==y)
            c[z][0]=x;
        else c[z][1]=x;
    }
    fa[x]=z,fa[y]=x;
    if (c[x][r]>0) fa[c[x][r]]=y;
    c[y][l]=c[x][r];
    c[x][r]=y;
}

void Splay(int x) {
    top=0;
    st[++top]=x;
    for (int i=x;!IsRoot(i);i=fa[i])
        st[++top]=fa[i];
//  rep(i,1,top) Clear(st[i]);
    per(i,top,1) Clear(st[i]);

    while (!IsRoot(x)) {
        int y=fa[x],z=fa[y];
        if (!IsRoot(y)) {
            if ((c[y][0]==x)^(c[z][0]==y))
                Rotate(x);
            else Rotate(y);
        }
        Rotate(x);
    }
}

void Access(int x) {
    int t=0;
    while (x>0) {
        Splay(x);
        c[x][1]=t;
        fa[t]=x;
        t=x;
        x=fa[x];
    }
}

void Evert(int x) {
    Access(x);
    Splay(x);
    rev[x]^=1;
}

void Link(int x,int y) {
    Evert(x);
    fa[x]=y;
    Splay(x);
}

void Cut(int x,int y) {
    Evert(x);
    Access(y);
    Splay(y);
    c[y][0]=fa[x]=0;
}

int Find(int x) {
    Access(x);
    Splay(x);
    int t=x;
    while (c[t][0]>0)
        t=c[t][0];
    Splay(t);
    return t;
}

int Judge(int x,int y) {
    int fx=Find(x),fy=Find(y);
    return fx==fy;
}

int main(void) {
    #ifndef ONLINE_JUDGE
    freopen("sdchr.in","r",stdin);
    freopen("sdchr.out","w",stdout);
    #endif

    n=rd(),m=rd();
    rep(i,1,m) {
        scanf("%s",s+1); int x=rd(),y=rd();
        switch (s[1]) {
            case 'C':
                Link(x,y);
                break;
            case 'D':
                Cut(x,y);
                break;
            case 'Q':
                int t=Judge(x,y);
                if (t) printf("Yes\n"); else printf("No\n");
                break;
        }
    }

    return 0;
}