#include <fstream>
#define NMAX 100007

using namespace std;

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

int n,m;
int tata[NMAX],h[NMAX];

void Union(int x, int y);
int Find(int x);

int main()
{
    int x,y,rx,ry,op,i;

    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>op>>x>>y;
        if(op==1)
        {
            rx=Find(x); ry=Find(y);
            Union(rx,ry);
        }
        else
        {
            rx=Find(x); ry=Find(y);
            if(rx==ry)
                fout<<"DA\n";
            else fout<<"NU\n";
        }
    }
    return 0;
}

void Union(int x, int y)
{
    if(h[x]>h[y])
        tata[y]=x;
    else if(h[y]>h[x])
        tata[x]=y;
    else
    {
        tata[y]=x;
        h[x]++;
    }
}

int Find(int x)
{
    int rad,aux;

    rad=x;
    while(tata[rad]) rad=tata[rad];

    while(tata[x] && tata[x]!=rad)
    {
        aux=tata[x];
        tata[x]=rad;
        x=aux;
    }

    return rad;
}