#include<iostream>
#include<cstdio>
#define maxn 100010
using namespace std;
int TT[maxn],RG[maxn],n,m,i,op,x,y;

int find(int x)
{
    int R, y;
    for (R = x; TT[R] != R; R = TT[R]);
    while(TT[x]!=x)
    {
        y = TT[x];
        TT[x] = R;
        x = y;
    }
    return R;
}

void unite(int x, int y)
{
    if(RG[x]>RG[y])
        TT[y]=x;
    else
        TT[x]=y;
    if (RG[x] == RG[y]) RG[y]++;
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
        TT[i]=i,RG[i]=1;
    while(m--)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(op==2)
            if(find(x) == find(y))  printf("DA\n");
                else    printf("NU\n");
        else
            unite(find(x), find(y));
    }
    return 0;
}