#include <fstream>

using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int root[100004];
int findr(int a)
{
    if(root[a]==a) return a;
    return findr(root[a]);
}
void add(int a, int b)
{
    if(a!=b) root[b]=a;
}

int main()
{int t,y,x,n,i,m;
in>>n;
for(i=1;i<=n;i++) root[i]=i;
in>>m;
while(m--)
{
    in>>t>>x>>y;
    x=findr(x);
    y=findr(y);
    if(t==1)
    {
        add(x,y);
    }
    else
    {
        if(x==y)
            out<<"DA"<<'\n';
        else
            out<<"NU"<<'\n';
    }

}
    return 0;
}