#include <iostream>
#include <fstream>
#define N 100020

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int Rg[N],T[N],i,j,n,m,x,y,cd;
void concatenez(int x,int y)
{
    if(Rg[x]>Rg[y])
    {
        T[y]=x;
    }
    else
        T[x]=y;
    if(Rg[x]==Rg[y])
        Rg[y]++;
}
int gasesc(int nod)
{
    int R,y;
    for(R=nod;R!=T[R];R=T[R]);
    for(;T[nod]!=nod;)
    {
        y=T[nod];
        T[nod]=R;
        nod=y;
    }
    return R;
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        T[i]=i;
        Rg[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        f>>cd>>x>>y;
        if(cd==2)
        {
            if(gasesc(x)==gasesc(y))
            {
                g<<"DA"<<"\n";
            }
            else
                g<<"NU"<<"\n";
        }
        else
        {
            if(gasesc(x)==gasesc(y))
                return 0;
            concatenez(gasesc(x),gasesc(y));
        }
    }
}