#include <iostream>
#include <stdio.h>
#define NMax 100020
using namespace std;
int tata[NMax],rang[NMax],x,y,N,M,op;

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

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

int Radacina(int x)
{
    int rad,y;
    for(rad=x;rad!=tata[rad];rad=tata[rad]);//urc pe nivele in arbore

    while(tata[x]!=x)//fac compresia drumurilor
    {
        y=tata[x];
        tata[x]=rad;//leg nodul x de radacina rad
        x=y;
    }
    return rad;
}

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

    for(int i=1;i<=M;i++)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(op==2)
            if(Radacina(x)==Radacina(y))
            printf("DA\n");
            else printf("NU\n");
        else Union(Radacina(x),Radacina(y));//unesc radacinile nodurilor x si y
    }
}

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