#include <cstdio>
using namespace std;
#define NMax 100020
int tata[NMax],rankit[NMax];
void MakeSet(int x)
{
    tata[x]=x;
    rankit[x]=0;
}
int FindSet(int x)
{
    if(tata[x]!=x)
    {
        tata[x]=FindSet(tata[x]);
    }
    return tata[x];
}
void Union(int x, int y)
{
    if(rankit[x]>rankit[y])
    {
        tata[y]=x;
    }
    else if(rankit[x]<rankit[y])
    {
        tata[x]=y;
    }
    else
    {
        tata[x]=y;
        rankit[y]++;
    }
}
int main()
{
    int n,m;
    int c,x,y,i;
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++) MakeSet(i);
    for(i=1;i<=m;i++)
    {
        int c,x,y;
        scanf("%d%d%d",&c,&x,&y);
        if(c==1)
        {
            Union(FindSet(x),FindSet(y));
        }
        else
        {
            if(FindSet(x)==FindSet(y))
                printf("DA\n");
            else printf("NU\n");
        }
    }
}