#include <bits/stdc++.h>
using namespace std;
int i,n,nrt,c,x,y,q,w,t[100005];
int tata(int x)
{
    if(t[x]==x)return x;
    return tata(t[x]);
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&nrt);
    for(i=1;i<=n;i++)
        t[i]=i;
    for(i=1;i<=nrt;i++)
    {
        scanf("%d%d%d",&c,&x,&y);
        if(c==1)
        {
            q=tata(x);
            w=tata(y);
            t[w]=q;
        }
        else
        {
            q=tata(x);
            w=tata(y);
            if(q==w)printf("DA\n");
            else printf("NU\n");
        }
    }
    return 0;
}