#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,op,tata[100001],x,y;

int root(int x){
    while(tata[x]>0)
        x=tata[x];
    return x;
}
void join(int x,int y){
    if(tata[x]<tata[y]){
        tata[x]+=tata[y];
        tata[y]=x;
    }else{
        tata[y]+=tata[x];
        tata[x]=y;
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        tata[i]=-1;
    for(int i=1;i<=m;i++){
        fin>>op;
        if(op==1){
            fin>>x>>y;
            int rx=root(x);
            int ry=root(y);
            if(rx!=ry)
                join(rx,ry);
        }else if(op==2){
            fin>>x>>y;
            int rx=root(x);
            int ry=root(y);
            if(rx!=ry)
                fout<<"NU"<<"\n";
            else
                fout<<"DA"<<"\n";
        }
    }
    return 0;
}