#include <bits/stdc++.h>

using namespace std;
int op,n,m,tata[100005],gr[100005];

int findn(int x)
{
    int root=tata[x];
    while (root!=tata[root])
        root=tata[root];

    while (tata[x]!=root)
    {
        int aux=tata[x];
        tata[x]=root;
        x=aux;
    }
    return root;
}
void unite(int x,int y)
{
    if (tata[x]==tata[y])
        return;
    if (gr[x]<gr[y])
        tata[x]=tata[y];
    else
        tata[y]=tata[x];
    if (gr[x]==gr[y])
        ++gr[x];
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;++i)
    {
        tata[i]=i;
        gr[i]=1;
    }
    int x,y;
    for (int i=1;i<=m;++i)
    {
        scanf("%d%d%d",&op,&x,&y);
        if (op==1)
        {
            unite(findn(x),findn(y));
        }
        else
        {
            if (findn(x)==findn(y))
                printf("DA\n");
                else
                    printf("NU\n");
        }
    }
    return 0;
}