# include <bits/stdc++.h>

using namespace std;

const int Nmax = 1e5 + 5;
int n, m, i, type, x, y, t[Nmax], rang[Nmax];

int Find(int x)
{
    if (t[x] != x) t[x] = Find(t[x]);
    return t[x];
}

void unite(int x, int y)
{
    if (rang[x] > rang[y]) t[y] = x;
    else t[x] = y;

    if (rang[x] == rang[y]) rang[y]++;
}

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

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

    for (i = 1; i <= n; ++i)
        t[i] = i, rang[i] = 1;

    for (i = 1; i <= m; ++i)
    {
        scanf("%d %d %d\n", &type, &x, &y);
        if (type == 1) unite(x, y);
        if (type == 2)
        {
            if (Find(x) == Find(y)) printf("DA\n");
            else printf("NU\n");
        }
    }

    return 0;
}