#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int   n,m,cod,x,y,rd[100010],rg[100010];

int findd(int x)
{
    int f,y;
    for(f=x; rd[f]!=f; f=rd[f]);

    for (; rd[x]!=x;)
    {
        y = rd[x];
        rd[x]=f;
        x = y;
    }
    return f;
}
void unite(int x, int y)
{
    if(rg[x]>rg[y]) rd[y]=x;
    else  rd[x]=y;
     if(rg[x]==rg[y]) rg[y]++;
}
int main()
{
    f>>n>>m;
    for(int i=1; i <=n; i++)
        {rd[i]=i; rg[i]=1;}
    for(int i=1; i<=m; i++)
    {
        f>>cod>>x>>y;
        if(cod==1)
            {if(findd(x)!=findd(y)) unite(findd(x), findd(y));}
        else {if(findd(x)==findd(y)) g<<"DA"; else g<<"NU"; g<<'\n';}
    }
}