#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");

int n,m,tata[100010];
int c,x,y;

int bigdaddy(int dad)
{
    int R=dad;
    while(tata[R]!=0)
        R=tata[R];
    while(tata[x]!=0)
    {
        int aux=tata[x];
        tata[x]=R;
        x=aux;
    }
    return R;
}
void mergedads()
{
    int a=bigdaddy(x);
    int b=bigdaddy(y);
    tata[a]=b;
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>c>>x>>y;
        if(c==1)
        {
            mergedads();
        }
        else
        {
            if(bigdaddy(x)==bigdaddy(y))
                out<<"DA\n";
            else
                out<<"NU\n";
        }
    }
    return 0;
}