#include <cstdio>
using namespace std;
int n,que,t[100010],rang[100010],x,y,i,instr;
inline int findd(int x)
{
    if (t[x]==x)return x;
    t[x]=findd(t[x]);
}
inline void uneste(int x,int y)
{
    x=findd(x);
    y=findd(y);
    if (rang[x]>rang[y])t[y]=x;
    else if (rang[x]<rang[y])t[x]=y;
    else
    {
        rang[x]++;
        t[y]=x;
    }
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d %d",&n,&que);
    for (i=1; i<=n; i++)
    {
        t[i]=i;
        rang[i]=1;
    }
    for (i=1; i<=que; i++)
    {
        scanf("%d %d %d",&instr,&x,&y);
        if (instr==1) uneste(x,y);
        else
            if (findd(x)==findd(y))printf("DA\n");
            else printf("NU\n");
    }
    return 0;
}