#include <fstream>
#define NMAX 100102
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m;
int tata[NMAX];
int h[NMAX];
int Find(int x);
void Union(int x,int y);
int main()
{
    int i,op,x,y;
    fin>>n;
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>op;
        fin>>x>>y;
        if(op==1)
            Union(x,y);
        else
        {
            if(Find(x)==Find(y))
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
        }
    }
    return 0;
}
int Find(int x)
{
    int rad=x,y;
    while(tata[rad]!=0)
        rad=tata[rad];
    ///compresez drumul
    while(tata[x]!=0)
    {
        y=tata[x];
        tata[x]=rad;
        x=y;
    }
    return x;
}
void Union(int x,int y)
{
    int radx,rady;
    radx=Find(x);
    rady=Find(y);
    if(h[radx]>h[rady])
        tata[rady]=radx;
    else
    {
        tata[radx]=rady;
        if(h[radx]==h[rady])
            h[rady]++;
    }
}