#include <cstdio>
#include <iostream>
#define Nmax 100005
using namespace std;
int n,m,i,op,x,y,rad1,rad2;
int ar[Nmax],nivel[Nmax];
int search(int nod)
{
  while(nod!=ar[nod])
    nod=ar[nod];
    return(nod);
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;++i) {ar[i]=i;nivel[i]=1;}
    for(i=1;i<=m;++i)
    {
        scanf("%d %d %d",&op,&x,&y);
        if (op==1)
        {
            rad1=search(x);rad2=search(y);
            if (nivel[rad1]>nivel[rad2]) ar[rad2]=rad1;
            else if (nivel[rad1]<nivel[rad2]) ar[rad1]=rad2;
            else {ar[rad2]=rad1;++nivel[rad1];}
        }
        else if (search(x)==search(y)) printf("DA\n");
        else printf("NU\n");
    }
    return 0;
}