#include<algorithm>
using namespace std;
#include<vector>
#include<queue>

#define DIM 100005
vector <int> lst[DIM];
queue <int> c;

int r[DIM],t[DIM],n;
void show ()
{
    int i;
    for(i=1;i<=n;++i)
        printf("%d ",r[i]);
    printf("\n");
    for(i=1;i<=n;++i)
        printf("%d ",t[i]);
    printf("\n\n");
    
}
void unite (int x,int y)
{
    int i,nr;
    if(r[t[x]]>r[t[y]])
    {
        unite(y,x);
        return ;
    }
    r[t[y]]+=r[t[x]];
    lst[t[y]].push_back (t[x]);
    c.push (t[x]);
    t[x]=t[y];
    while(!c.empty ())
    {
        nr=c.front ();
        for(i=0;i<lst[nr].size ();++i)
        {
            t[lst[nr][i]]=t[y];
            c.push (lst[nr][i]);
        }
        c.pop ();
    }
}
int main ()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int i,m,q,x,y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
        t[i]=i,r[i]=1;
    for(i=1;i<=m;++i)
    {
       // show ();
        scanf("%d%d%d",&q,&x,&y);
        if(q==1)
            unite (x,y);
        else
        {
            if(t[x]==t[y])
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}