#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,inaltime[100001],tata[100001],op,x,y;
int rad(int nod){
    int aux=nod,aux2;
    while(tata[aux]!=aux)
        aux=tata[aux];
    while(tata[nod]!=nod){
        aux2=tata[nod];
        tata[nod]=aux;
        nod=aux2;
    }
    return aux;
}
void uneste(int x,int y){
    if(inaltime[x]>inaltime[y])
        tata[y]=x;
    else
        tata[x]=y;
    if(inaltime[x]==inaltime[y])
        inaltime[y]++;
}
int main(){
    f>>n>>m;
    for (int i = 1; i < n; ++i) {
        tata[i]=i;
        inaltime[i]=1;
    }
    for (int i = 0; i < m; ++i) {
        f>>op>>x>>y;
        if(op == 1){
            uneste(rad(x),rad(y));
        }
        else{
            if(rad(x)!= rad(y))
                g<<"NU\n";
            else
                g<<"DA\n";
        }
    }

    return 0;
}