#include <stdio.h>
using namespace std;

int a[100005],n,m;

int find(int x)
{
    while (a[x]!=x) x=a[x];
    return x;
}

void uneste(int x, int y)
{
    a[x]=y;
}

int main()
{
    int i,c,x,y;
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%i%i",&n,&m);
    for (i=1; i<=n; i++)
        a[i]=i;
    for (i=0; i<m; i++)
    {
        scanf("%i%i%i",&c,&x,&y);
        if (c==2)
        {
            if (find(x)==find(y)) printf("DA\n");
            else printf("NU\n");
        }
        else
            uneste(find(x),find(y));

    }
}