#include<bits/stdc++.h>
#define maxN 100005
using namespace std;
int t[maxN],n,m,op,x,y;
void update(int x,int y)
{
    while(t[x]>=0) x=t[x];
    while(t[y]>=0) y=t[y];
    if(x==y) return;
    if(t[x]<t[y])
    {
        t[x]+=t[y];
        t[y]=x;
    }
        else
    {
        t[y]+=t[x];
        t[x]=y;
    }
}
int query(int x,int y)
{
    while(t[x]>0) x=t[x];
    while(t[y]>0) y=t[y];
    if(x==y) return 1;
        return 0;
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) t[i]=-1;
    for(int i=1;i<=m;i++)
    {
        scanf("%d",&op);
        if(op==1)
        {
            scanf("%d%d",&x,&y);
            update(x,y);
        }
            else
        {
            scanf("%d%d",&x,&y);
            int q=query(x,y);
            if(q) printf("DA\n");
                else printf("NU\n");
        }
    }
    return 0;
}