#include <bits/stdc++.h>

using namespace std;

int v[100005];

int first(int a) {
    a = v[a];
    while(a != v[a])
        a = v[a];
    return a;
}

void mergeList(int a, int b) {
    v[first(a)] = v[first(b)];
}

int main()
{
    FILE *f = fopen("disjoint.in", "r");
    FILE *g = fopen("disjoint.out", "w");
    int n, m;
    int x, y, t;
    fscanf(f, "%d %d", &n, &m);

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

    for(int i = 1; i <= m; i ++) {
        fscanf(f, "%d %d %d", &t, &x, &y);
        if(t == 1) mergeList(x, y);
        else {
            if(first(x) == first(y))
                fprintf(g, "DA\n");
            else fprintf(g, "NU\n");
        }
    }
    return 0;
}