#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

int v[100001];
vector<int> stack;

int find_dad(int nod){

    int dad;
    stack.push_back(nod);
    while(nod != v[nod]){
        stack.push_back(v[nod]);
        nod = v[nod];

    }
    dad = v[nod];
    while(!stack.empty()){
        nod = stack.back();
        stack.pop_back();
        v[nod] = dad;
    }
    return dad;
}
char buff[200000];int pos=0;
FILE*f=freopen("disjoint.in","r",stdin);
FILE*g=freopen("disjoint.out","w",stdout);
inline void read(int &nr){
    while(buff[pos] < '0' || buff[pos] > '9')if(++pos == 200000) fread(buff, 1, 200000, stdin), pos = 0;
    nr = 0;
    while('0' <= buff[pos] && buff[pos] <= '9') {nr = nr * 10 + buff[pos] - '0';if(++pos == 200000) fread(buff, 1, 200000, stdin), pos = 0;}
}
char buf[200000]="";
int lg = -1;
void scrie(bool r){
    if(r){
        buf[++lg] = 'D';
        buf[++lg] = 'A';
        buf[++lg] = '\n';
    }
    else{
        buf[++lg] = 'N';
        buf[++lg] = 'U';
        buf[++lg] = '\n';
    }

    if(lg > 199992) fwrite(buf, lg+1, 1, stdout), lg = -1;
}
int main()
{
    int i, j, n, m, op, a, b, ta, tb;
    fread(buff, 1, 200000, stdin);
    read(n);read(m);
    for(i=1; i<=n; i++)
        v[i]=i;
    for(int t=1;t<=m;t++){

        read(op);read(a);read(b);
        if(op==1){
            ta=find_dad(a);
            tb=find_dad(b);
            v[tb]=ta;
        }
        else{

            ta=find_dad(a);
            tb=find_dad(b);
            scrie(ta==tb);
                //printf("DA\n");
            //else printf("NU\n");

        }
    }
    fwrite(buf, lg+1,  1, stdout);
}