#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,op,x,y,rang[100005],radacina[100005];

int cautaRadacina(int x)
{
    int R=x;
    while(R != radacina[R])
    {
        R=radacina[R];
    }
    while(radacina[x]!=x)
    {
        int aux=radacina[x];
        radacina[x]=R;
        x=aux;
    }
    return R;
}

void reuniune(int x, int y)
{
    if(rang[x]<rang[y])
        radacina[x]=y;
    else
        radacina[y]=x;
    if(rang[x]==rang[y])
        rang[x]++;
    return;
}
int main()
{   f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        radacina[i]=i;
        rang[i]=1;
    }
    for(int i=1;i<=m;i++)
    {   f>>op>>x>>y;
        if(op==1)
        {
            if(cautaRadacina(x) != cautaRadacina(y))
                reuniune(cautaRadacina(x), cautaRadacina(y));
        }
        else
        {
            if(cautaRadacina(x) == cautaRadacina(y))
                g<<"DA"<<endl;
            else
                g<<"NU"<<endl;
        }
    }
    return 0;
}