#include <stdio.h>

using namespace std;
FILE *fin = fopen("disjoint.in" , "r");
FILE *fout = fopen("disjoint.out" , "w");

int N, M, boss[100001];

int find(int x){
    if(boss[x] == x){
        return x;
    }

    else{
            boss[x] = find(boss[x]);
        return find(boss[x]);
    }
}

void Union(int x, int y){
    int aux1, aux2;

    aux1 = find(x);
    aux2 = find(y);

    boss[aux2] = aux1;
}


int main()
{
    int i, cod, x, y;

    fscanf(fin, "%d %d\n", &N, &M);

    for(i = 1; i <= N; i++){
        boss[i] = i;
    }

    for(i = 1; i <= M; i++){
        fscanf(fin, "%d %d %d\n", &cod, &x, &y);

        if(cod == 1){
            Union(x, y);
        }

        else {
            if(find(x) == find(y))
                fprintf(fout, "DA\n");

            else fprintf(fout, "NU\n");
        }
    }
}