#include <fstream>
#define NMAX 100006
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int tata[NMAX];
int h[NMAX]; //inaltimile
int Find(int x); //returneaza radacina pentru nodul lui x
void Union(int x,int y); //unifica arborii in care se afla x si y
int n,x,y,rx,ry,m,i;
int q;
int main()
{

    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>q;
        cin>>x>>y;
        if(q==1)
        {

            rx=Find(x);
            ry=Find(y);
            Union(rx,ry);
        }
        else
        {
            if(Find(x)==Find(y))
                cout<<"DA";
            else cout<<"NU";
            cout<<'\n';
        }
    }
}
int Find(int x)
{
    int rad,y;
    rad=x;
    while(tata[rad])
    {
        rad=tata[rad];
    }
    while(tata[x] && tata[x]!=rad)
    {
        y=tata[x];
        tata[x]=rad;
        x=y;
    }
    return rad;
}
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]++;
        }
    }
}