#include <iostream>
#include <fstream>

using namespace std;

int tata[100002],n,m,h[100005];
int find(int x)
{
    while(tata[x]!=x)
        x=tata[x];

    return x;
}
void reuniune(int x,int y)
{
    if(h[find(x)]<h[find(y)])
    tata[x]=tata[y];
    else
    tata[y]=tata[x];
}
int main()
{
     freopen("disjoint.in","r",stdin);
     freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);

     for(int i=1; i<=n; i++)
     {
         tata[i]=i;
         h[i]=0;
     }
    for(int i=1; i<=m; i++)
    {
        int tip,x,y;
        scanf("%d%d%d",&tip,&x,&y);
        if(tip==1)
        {
            reuniune(x,y);
        }
        else
        {
            if(find(x)==find(y))
            printf("DA\n");
            else printf("NU\n");
        }
    }


    return 0;
}