RE？

#include<iostream>
#include<cstdio>
#define maxn 5001
using namespace std;
int fa[maxn];
int m,n,x,y,z;
int find(int x)
{
    if(fa[x]!=x)return find(fa[x]);
    else return x;
}
void unio(int r1,int r2)
{
    fa[r2]=r1;
}
void pan(int x,int y)
{
    if(find(x)==find(y))cout<<"Y"<<endl;
    else cout<<"N"<<endl;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)fa[i]=i;
    for(int i=1;i<=m;i++)
    {
        cin>>z>>x>>y;
        if (z==2)pan(x,y);
        else if (z==1)
        {
            int r1=find(x);
        int r2=find(y);
        if (r1!=r2)unio(r1,r2);
        }
    }
    return 0;
}