#include <stdio.h>
#define nmax 100001

using namespace std;

int N, T, P[nmax], cod, x, y;

int grupa(int i){
    if (P[i] == i) return i;
        P[i] = grupa(P[i]);
    return P[i];
}

void reuniune(int i,int j){
    P[grupa(i)] = grupa(j);
}
int main() {
    freopen ("disjoint.in", "r", stdin);
    freopen ("disjoint.out", "w", stdout);
    scanf ("%d %d", &N, &T);
    int i;
    for (i = 1; i <= N; ++i) P[i] = i;
    for (i = 1; i <= T; ++i) {
        scanf ("%d %d %d", &cod, &x, &y);
        if (cod == 1) reuniune (x, y);
        if (cod == 2)
            if (grupa(x) == grupa(y)) printf ("DA\n");
            else printf ("NU\n");
    }
    return 0;
}