#include <cstdio>
#define NMAX 100002
using namespace std;

int n, m, RG[NMAX], T[NMAX];
inline int find(int x){
    int R;
    for(R = x; T[R] != R ; R = T[R]) ;
    while(T[x] != x){
        int y = T[x];
        T[x] = R;
        x = y;
    }
    return R;
}
inline void Unite(int x, int y){
    if(RG[x] > RG[y])
        T[y] = x;
    else
        T[x] = y;
    if(RG[x] == RG[y])
        ++RG[y];
}
int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n ; ++i){
        RG[i] = 1;
        T[i] = i;
    }
    int x, y, TIP;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d%d", &TIP, &x, &y);
        if(TIP == 1){
            Unite(find(x), find(y));
        }
        else{
            if(find(x) == find(y))
                printf("DA");
            else
                printf("NU");
            printf("\n");
        }
    }
    return 0;
}