#include <iostream>
#include <cstdio>
using namespace std;
int n,m,vTati[100005];
int findRoot(int nod)
{
    int root=nod;
    while(vTati[root]!=root)
    {
        root=vTati[root];
    }
    vTati[nod]=root;
    return nod;
}
bool query(int n1,int n2)
{
    return (findRoot(n1)==findRoot(n2));
}
void reuniune(int n1,int n2)
{
    vTati[n1]=n2;
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    int cod,nod1,nod2;
    for(int i=1;i<=n;i++)
        vTati[i]=i;

    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&cod,&nod1,&nod2);
        if(cod==1)
        {
            reuniune(findRoot(nod1),findRoot(nod2));
        }
        else
        {
            if(query(nod1,nod2))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}