#include <stdio.h>

const int Nmax = 100005;

int n, m;
int root[Nmax], deg[Nmax];

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

void join(int x, int y) {
    if (deg[x] < deg[y])
        root[x] = y;
    else
        root[y] = x;
    if (deg[x] == deg[y])
        ++deg[x];
}

int main() {
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);

    int op, x, y;

    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; ++i)
        root[i] = i;

    for (int i = 1; i <= m; ++i) {
        scanf("%d %d %d", &op, &x, &y);
        if (op == 1)
            join(find(x), find(y));
        else {
            if (find(x) == find(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }

    return 0;
}