#include <iostream>
#include <cstdio>
using namespace std;
int const NMAX=100000;
int t[NMAX+5];
int h[NMAX+5];
int FindSet(int x) {
    while(x!=t[x])
        x=t[x];
    return x;
}
void UnionSet(int x,int y) {
    if(h[x]>h[y])
        t[y]=x;
    else if(h[y]>h[x])
        t[x]=y;
    else {
        h[x]++;
        t[y]=x;
    }
}
int main() {
    //Paduri de multimi disjuncte
    FILE *fin,*fout;
    fin=fopen("disjoint.in","r");
    fout=fopen("disjoint.out","w");
    int n,m,cod,x,y,i,tx,ty;
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=n; i++) {
        h[i]=1;
        t[i]=i;
    }
    for(i=1; i<=m; i++) {
        fscanf(fin,"%d%d%d",&cod,&x,&y);
        if(cod==1) {
            tx=FindSet(x);
            ty=FindSet(y);
            if(tx!=ty)
                UnionSet(tx,ty);
        } else {
            tx=FindSet(x);
            ty=FindSet(y);
            if(tx==ty)
                fprintf(fout,"DA\n");
            else
                fprintf(fout,"NU\n" );
        }
    }
    fclose(fin);
    fclose(fout);
    return 0;
}