#include <cstdio>
using namespace std;
const int NMAX=100005;
int t[NMAX],h[NMAX];
int FindSet(int x)
{
    while(x!=t[x])
        x=t[x];
    return x;
}
void UnionSet(int tx,int ty)
{
    if(h[tx]==h[ty])
    {
        h[tx]++;
        t[ty]=tx;
    }
    else
    {
        if(h[tx]>h[ty])
            t[ty]=tx;
        else
            t[tx]=ty;
    }
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m,i,x,y,tx,ty,tip;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        h[i]=1;
        t[i]=i;
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&tip,&x,&y);
        tx=FindSet(x);
        ty=FindSet(y);
        if(tip==1)
        {
            if(tx!=ty)
                UnionSet(tx,ty);
        }
        else
        {
            if(tx==ty)
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}