#include <fstream>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n,i,k,bk_a,bk_b,c;
struct vct
{
    int x,y;
}tati[100002];
void reunire(int a, int b)
{
    while(tati[a].x!=0)
    a=tati[a].x;
    while(tati[b].x!=0)
    b=tati[b].x;
    if(tati[a].y>tati[b].y)
    {
        tati[a].y=max(tati[a].y,tati[b].y+1);
        tati[b].x=a;
    }
    else
    {
        tati[b].y=max(tati[b].y,tati[a].y+1);
        tati[a].x=b;
    }
}
void colegi(int a, int b)
{
    bk_a=a; bk_b=b;
    while(tati[a].x!=0)
    a=tati[a].x;
    while(tati[b].x!=0)
    b=tati[b].x;
    if(a==b)
        g<<"DA"<<'\n';
    else
        g<<"NU"<<'\n';
    if(tati[bk_a].x!=0)
    tati[bk_a].x=a;
    if(tati[bk_b].x!=0)
    tati[bk_b].x=b;
}

int main()
{
    f>>n>>k;
    int a,b;
    for(i=1;i<=k;i++)
    {
        f>>c>>a>>b;
        if(c==1)
        reunire(a,b);
        else
        colegi(a,b);
    }
    return 0;
}