#include <cstdio>

using namespace std;
int t[100005],h[100005];
int findset(int x)
{
    while (t[x]!=x)
        x=t[x];
    return x;
}
void unionset(int x,int y)
{
    if (h[x]==h[y]) {
        t[y]=x;
        h[x]++;
    }else if (h[x]>h[y])
            t[y]=x;
        else t[x]=y;
}
int main()
{
    freopen ("disjoint.in","r",stdin);
    freopen ("disjoint.out","w",stdout);
    int n,m,i,cod,x,y;
    scanf ("%d%d",&n,&m);
    for (i=1;i<=m;i++)
        t[i]=i,h[i]=1;
    for (i=1;i<=m;i++) {
        scanf("%d%d%d",&cod,&x,&y);
        if (cod==1) {
            x=findset(x);
            y=findset(y);
            unionset(x,y);
        }else if (findset(x)==findset(y))
                printf ("DA\n");
            else printf ("NU\n");
    }
    return 0;
}