#include <fstream>

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

int n,i,k,bk_a,bk_b,c,tati[100002];
void reunire(int a, int b)
{
    while(tati[a]!=0)
    a=tati[a];
    while(tati[b]!=0)
    b=tati[b];
    tati[b]=a;
}
void colegi(int a, int b)
{
    bk_a=a; bk_b=b;
    while(tati[a]!=0)
    a=tati[a];
    while(tati[b]!=0)
    b=tati[b];
    if(a==b)
        g<<"DA"<<'\n';
    else
        g<<"NU"<<'\n';
    if(tati[bk_a]!=0)
    tati[bk_a]=a;
    if(tati[bk_b]!=0)
    tati[bk_b]=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;
}