#include<fstream>
using namespace std;
int Up[100001],Size[100001];
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int Find(int x)
{
    int r=x,y;
    //caut radacina
    while(Up[r]!=r)
        r=Up[r];
    //compresia drumului
    while(Up[x]!=x)
    {
        y=Up[x];
        Up[x]=r;
        x=y;
    }
    return r;
}

void Union(int rx,int ry)
{
    if(Size[rx]>Size[ry])
    {
        Up[ry]=rx;
        Size[rx]=Size[rx]+Size[ry];
    }
    else
    {
        Up[rx]=ry;
        Size[ry]=Size[ry]+Size[rx];
    }
}

int main()
{
    int n,m,i,op,x,y,rx,ry;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
       Up[i]=i;
       Size[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        rx=Find(x);
        ry=Find(y);
        if(op==2)
        {
            if(rx==ry)
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
        else
        {
            if(rx!=ry)
                Union(rx,ry);
        }
    }
}