#include <iostream>
#include <cstdio>
using namespace std;
long sef[100002];
int sefsuprem(int i)
{
    if(sef[i]==i)
        return i;
    return sef[i]=sefsuprem(sef[i]);
}
void unire(int x,int y)
{
    sef[x]=sefsuprem(x);
    sef[y]=sefsuprem(y);
    sef[sef[x]]=sef[y];
}
long n,m,i,x,y,c;
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;i++)
        sef[i]=i;
    for(i=1;i<=m;i++)
    {
        scanf("%d %d %d",&c,&x,&y);
        if(c==1)
            unire(x,y);
        else
            {
                sef[x]=sefsuprem(x);
                sef[y]=sefsuprem(y);
                if(sef[x]==sef[y])
                    printf("DA\n");
                else
                    printf("NU\n");
            }
    }
    return 0;
}