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