#include<stdio.h>

#define NMAX 100007

int n, m, a, b, Tip, H[NMAX], T[NMAX];

inline int father(int f){
    if(T[f] == f)
        return f;
    return father(T[f]);
}

void unite(int x, int y){
    if(H[x] > H[y])
        T[y] = x;
    else
        if(H[x] < H[y])
            T[x] = y;
        else{
            ++ H[x];
            T[y] = x;
        }
}

int main(){
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++ i){
        T[i] = i;
        H[i] = 1;
    }
    for(int i = 1; i <= m; ++ i){
        scanf("%d %d %d", &Tip, &a, &b);
        int tx = father(a);
        int ty = father(b);
        if(Tip  == 1)
            if(tx != ty)
                unite(a, b);
        if(Tip == 2)
            if(tx == ty)
                printf("DA\n");
            else
                printf("NU\n");
    }
    return 0;
}