#include <cstdio>

using namespace std;
int r[100005],h[100005];
int findset(int x)
{
    while(x!=r[x])
        x=r[x];
    return x;
}
void unionset(int x, int y)
{
    if(h[x]==h[y])
    {
        h[x]++;
        r[y]=x;
    }
    else
    {
        if(h[x]>h[y])
            r[y]=x;
        else
            r[x]=y;
    }
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int i,n,m,x,y,c,rx,ry;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        r[i]=i;
        h[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d",&c);
        if(c==1)
        {
            scanf("%d%d",&x,&y);
            rx=findset(x);
            ry=findset(y);
            if(rx!=ry)
                unionset(rx,ry);
        }
        else
        {
            scanf("%d%d",&x,&y);
            if(findset(x)==findset(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}