#include <iostream>
#include <cstdio>
using namespace std;

int N,M,parent[100002];

int get_parent(int x)
{
    if (parent[x] == x)
        return x;
     else
        return get_parent(parent[x]);
}

void join(int x,int y)
{
    int parent_x=get_parent(x);
    int parent_y=get_parent(y);
    parent[parent_x]=parent_y;
}

int find(int x,int y)
{
    return get_parent(x)==get_parent(y);
}

void citire()
{
    scanf("%d %d ",&N,&M);
    for(int i=1;i<=N;i++)
        parent[i]=i;
    for(int i=1;i<=M;i++)
    {
        int op,x,y;
        scanf("%d %d %d ",&op,&x,&y);
        if(op==1)
            join(x,y);
        else
            printf("%s\n",find(x,y)?"DA":"NU");
    }
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    citire();
    return 0;
}