#include <cstdio>

int t[100001];

int root(int x)
{
    int y = x, next;

    while(t[y])
    {
        y = t[y];
    }

    while(t[x])
    {
        next = t[x];

        t[x] = y;

        x = next;
    }

    return y;
}

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

    int n, m, cod, x, y;

    scanf("%d %d", &n, &m);

    while(m--)
    {
        scanf("%d %d %d", &cod, &x, &y);

        if(cod & 1)
        {
            t[root(x)] = root(y);
        }
        else
        {
            if (root(x) ^ root(y)) puts("NU");

            else puts("DA");
        }
    }
}