#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,T[100011];

int root(int x){
    while(T[x]>0)
        x=T[x];
   return x;
}

int main(void){
    register int i,j,x,y,t;

    f>>n>>m;
    for(i=1;i<=n;i++) T[i]=-1;
    for(i=1;i<=m;i++){
        f>>t>>x>>y;
        x=root(x);
        y=root(y);
        if(t==1){
            if(x==y)
                continue;
            if(T[x]<T[y])
                T[x]+=T[y],T[y]=x;
            else
                T[y]+=T[x],T[x]=y;
        }
        else{
            if(x==y)
                g<<"DA\n";
            else
                g<<"NU\n";
        }
    }

    f.close();
    g.close();
    return 0;
}