// Paduri de multimi disjuncte cu cele doua euristici

#include<cstdio>
#include<vector>
using namespace std;
const int NMAX = 100005;
int n,m,i,op,x,y,Father[NMAX],Rank[NMAX];
int find(int x)
{
    int aux,R;

    // gasesc multimea din care face parte x
    for(R=x;R!=Father[R];R=Father[R]);

    // aplic compresia drumurilor
    while(Father[x]!=x)
    {
        aux=Father[x];
        Father[x]=R;
        x=aux;
    }
    return R;
}
void unite(int x,int y)
{
    // unesc multimea cu rang mai mic de cea cu rang mai mare
    if(Rank[x]<Rank[y]) Father[x]=y;
    else if(Rank[x]>Rank[y]) Father[y]=x;
    else Father[y]=x, Rank[x]++;
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        Rank[i]=1;
        Father[i]=i;
    }
    for(;m;m--)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(op==1)
        {
            unite(x,y);
        }
        else
        {
            if(find(x)==find(y)) printf("DA\n");
            else printf("NU\n");
        }
    }
    return 0;
}