#include<cstdio>

const int nmax=1e5+5;

int tata[nmax],h[nmax];

inline int FindSet(int x)
{
    while(tata[x]!=x)
        x=tata[x];
    return x;
}

inline void UnionSet(int x,int y)
{
    int tata1=FindSet(x),tata2=FindSet(y);
    if(h[x]>h[y])
        tata[y]=x;
    else
        tata[x]=y;
    if(h[x]==h[y])
        h[y]++;
    return;
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int m,n,i,j,x,y,z;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        tata[i]=i;
        h[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&z,&x,&y);
        if(z==1)
            UnionSet(x,y);
        else
        {
            if(FindSet(x)==FindSet(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
}