求帮忙，按照刘汝佳的模板编的，wa7

#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
int p[10005];

int find(int t)
{
    return p[t] == t ? t : p[t] = find(p[t]); 
}

int main()
{
    int i,j,k,m,n,z,x,y;
    cin >> n >> m;
    for(i = 1; i <= 10000; i++)
        p[i] = i;
    for(i = 1; i <= m; i++)
    {
        cin >> z >> x >> y;
        if(z == 1)
        {
            if(find(x) != find(y))
                p[y] = x;
        }
        else
        {
            if(find(x) == find(y))
                cout << "Y";
            else
                cout << "N";
            cout << endl;
        }
    }

    return 0;
}