#include <fstream>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int tata[100001],tip,x,y,n,m,i;
int root(int a){
    while(tata[a]!=0)
        a=tata[a];
        return a;
    }
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++){
        f>>tip>>x>>y;
        if(tip==1)
            tata[root(x)]=root(y);
        else
            if(root(x)==root(y))
                g<<"DA"<<'\n';
            else
                g<<"NU"<<'\n';
    }
    return 0;
}