#include <cstdio>

using namespace std;
const int NMAX=100000;
int r[NMAX+5],h[NMAX+5];
int findset(int x) {
    while(r[x]!=x)
        x=r[x];
    return x;
}
void unionset(int x,int y) {
    if(h[x]==h[y])

    {

        h[x]++;
        r[y]=x;
    } else    if(h[x]>h[y])
        r[y]=x;
    else
        r[x]=y;


}
int main() {
    freopen("disjoint.in", "r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m,i,x,y,rx,ry,cod;
    scanf("%d%d",&n,&m);
    for(i=1; i<=n; i++) {
        r[i]=i;
        h[i]=1;
    }
    for(i=1; i<=m; i++) {
        scanf("%d%d%d",&cod,&x,&y);
        rx=findset(x);
        ry=findset(y);
        if(cod==1)
            if(r[x]!=r[y])
                unionset(rx,ry);
        if(cod==2)
                    {if(rx==ry)
                        printf("DA\n");
                    else
                        printf("NU\n");
                    }
    }
    return 0;
}