#include<fstream>
using namespace std;
int n,m,a,b,c,i,vecin[100003],r1,r2,rang[100003];
int cautare(int x)
{
    int R,y;
    for(R = x; vecin[R] != R; R = vecin[R]);

    for (; vecin[x] != x;)
    {
        y = vecin[x];
        vecin[x] = R;
        x = y;
    }
    return R;
}
void unesc(int x,int y)
{
    if(rang[x]>rang[y])
    {
        vecin[y]=x;
    }
    else
    {
        vecin[x]=y;
    }
    if(rang[x]==rang[y])
    {
        rang[y]++;
    }
}
int main()
{
     ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        vecin[i]=i;
        rang[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        fin>>c>>a>>b;
        if(c==2)
        {
            r1=cautare(a);
            r2=cautare(b);
            if(r1==r2)
            {
                fout<<"DA"<<"\n";
            }
            else
            {
                fout<<"NU"<<"\n";
            }
        }
        else
        {
            unesc(cautare(a),cautare(b));
        }
    }
    fin.close();
    fout.close();
    return 0;
}