#include<cstdio>
using namespace std;
const int NMAX=100000;
int t[NMAX+5],h[NMAX+5];
int findset(int x)
{
    while(x!=t[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,x,y,tip,xx,yy,m;
    scanf("%d%d",&n,&m);
    for(register int i=1;i<=n;i++)
    {
        t[i]=i;
        h[i]=1;
    }
    for(register int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&tip,&x,&y);
        xx=findset(x);
        yy=findset(y);
        if(tip==1) unionset(xx,yy);
            else if(xx==yy) printf("DA\n");
                else printf("NU\n");
    }
    return 0;
}