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