#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int NMAX=100001;
int dad[NMAX],n,m,rnk[NMAX];

void init()
{
    for(int i=1;i<=n;i++)
        dad[i]=i;
}

int do_find(int nod)
{
    if(dad[nod]!=nod)
    {
        int repr=do_find(dad[nod]);
        dad[nod] =repr;//compresia drumurilor
        return repr;
    }
}

void do_union(int n1, int n2)
{
    //union by rank
    int rx=do_find(n1);
    int ry=do_find(n2);

    if(rnk[rx]==rnk[ry])
    {
        dad[rx]=ry;
        rnk[ry]++;
    }
    else if(rnk[rx]<rnk[ry])
        dad[rx]=ry;
    else
        dad[ry]=rx;
}

int main()
{
    fin>>n>>m;
    init();
    for(int i=1;i<=m;i++)
    {
        int cod,x,y;
        fin>>cod>>x>>y;
        if(cod==1)
        {
            int rx=do_find(x);
            int ry=do_find(y);
            do_union(rx,ry);
        }
        else
        {
            int rx=do_find(x);
            int ry=do_find(y);
            if(rx==ry) fout<<"DA \n";
            else fout<<"NU \n";
        }
    }
}