#include <cstdio>

using namespace std;
int t[100010],h[100010];
inline int find(int x)
{
    while(t[x]!=x)
        x=t[x];
    return x;
}
inline void unifica(int x,int y)
{
    ///x si y sunt radacini de arbori
    if(h[x]>h[y])
        t[y]=x;
    else if(h[y]>h[x])
        t[x]=y;
    else
    {
        h[x]++;
        t[y]=x;
    }
}
int main()
{
    int n,m,i,c,x,y;
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        t[i]=i;
        h[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&c,&x,&y);
        if(c==1)
            unifica(find(x),find(y));
        else
            if(find(x)==find(y))
                printf("DA\n");
            else
                printf("NU\n");
    }
    return 0;
}