#include <iostream>
#include <stdio.h>
#define NMax 100005
using namespace std;
int tata[NMax],rang[NMax],X,Y,z,y,rad,op,N,M;

void Read()
{
    scanf("%d%d",&N,&M);
    for(int i=1;i<=N;i++)
    {
        tata[i]=i;
        rang[i]=1;
    }
}

int Radacina(int x)
{
    for(rad=x;rad!=tata[rad];rad=tata[rad]);

    while(y!=x)
    {
        y=tata[x];
        x=tata[x];
        tata[x]=rad;
    }
    return rad;
}

void Union(int x,int y)
{
    if(rang[x]>rang[y])
        tata[y]=x;
    else tata[x]=y;

    if(rang[x]==rang[y])
        rang[y]++;
}

void Solve()
{
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d%d",&op,&X,&Y);
        if(op==1)
            Union(Radacina(X),Radacina(Y));
        else if(op==2)
        {
            if(Radacina(X)==Radacina(Y))
                printf("DA\n");
            else printf("NU\n");
        }
    }
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    Read();
    Solve();
}