#include <bits/stdc++.h>

const int Nmax = 100000 + 10;

int tata[Nmax];

int getRoot(int a)
{
    if (a == tata[a])
        return a;
    else
        return tata[a] = getRoot(tata[a]);
}

int main() {

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

    int N, M;
    scanf("%d %d", &N, &M);

    for (int i = 1; i <= N; ++i)
        tata[i] = i;

    while (M--)
    {
        int tip, a, b;

        scanf("%d %d %d ", &tip, &a, &b);

        if (tip == 1)
            tata[b] = a;
        else
             if (getRoot(a) == getRoot(b))
                puts("DA");
            else
                puts("NU");
    }

}