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