#include <cstdio>
using namespace std;

const int nmx = 100005;

int n, m;
int rang[nmx], parinte[nmx];

int gaseste_radacina(int nod){
    int f = nod;

    while(f != parinte[f])
        f = parinte[f];

    while(nod != parinte[nod]){
        int aux = parinte[nod];
        parinte[nod] = f;
        nod = aux;
    }

    return f;
}

void uneste(int nod1, int nod2){
    if(rang[nod1] > rang[nod2])
        parinte[nod2] = nod1;
    else
        parinte[nod1] = nod2;
    if(rang[nod1] == rang[nod2])
        ++ rang[nod2];
}

int main(){
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);

    scanf("%d %d", &n, &m);

    for(int i = 1; i <= n; ++i){
        rang[i] = 1;
        parinte[i] = i;
    }

    for(int i = 1; i <= m; ++i){
        int c, el1, el2;
        scanf("%d %d %d", &c, &el1, &el2);
        if(c == 2)
            printf("%s\n", gaseste_radacina(el1) == gaseste_radacina(el2) ? "DA" : "NU");
        else
            uneste(gaseste_radacina(el1),gaseste_radacina(el2));
    }

    return 0;
}