#include <bits/stdc++.h>
using namespace std;
const int nmax = 100005;
int arb[nmax];

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

void Unite(int x, int y)
{
    x=Find(x);
    y=Find(y);
    arb[x]=y;
}

int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    int n, m, o, x, y, i;
    scanf("%d %d", &n, &m);
    for(i=1; i<=n; i++)
        arb[i]=i;
    for(i=1; i<=m; i++)
    {
        scanf("%d %d %d", &o, &x, &y);
        if(o==1) Unite(Find(x), Find(y));
        else
        {
            if(Find(x)==Find(y)) printf("DA\n");
            else printf("NU\n");
        }
    }
    return 0;
}