#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 100001

int rad[MAX],n;

int tata(int x){
    if(x != rad[x])rad[x]=tata(rad[x]);
    return rad[x];
}

int main(){
    int m,c,x,y;
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=1;i<=n;i++)rad[i]=i;
        while(m--)
        {
            scanf("%d %d %d",&c,&x,&y);
            if(c==2)printf("%s\n",tata(x)==tata(y) ? "DA" : "NU");
            else rad[tata(x)]=tata(y);
        }
    return 0;
}