#include <fstream>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int NMAX=100000;
int t[NMAX+5],h[NMAX+5];

int FindSet(int x)
{
    while(t[x]!=x)
        x=t[x];
    return x;
}

void UnionSet(int x, int y)
{
    /*x,y - radacinile celor doi arbori care se unifica*/

    if(h[x]>h[y])
    {
        t[y]=x;
    }
    else if(h[y]>h[x])
    {
        t[x]=y;
    }
    else
    {
        t[y]=x;
        h[x]++;
    }

}

int main()
{
    int n,m,i,j,x,y,cod,rx,ry,nr=0;
    fin>>n>>m;

    for(i=1; i<=n; i++)
    {
        t[i]=i;
        h[i]=1;
    }
    for(i=1; i<=m; i++)
    {
        fin>>cod>>x>>y;
        rx=FindSet(x);
        ry=FindSet(y);
        if(cod==1)
        {
            if(rx!=ry) UnionSet(rx,ry);
        }
        else
        {
            if(rx==ry) fout<<"DA"<<"\n";
            else fout<<"NU"<<"\n";
        }

    }

    return 0;
}