#include <cstdio>

int N,M,parent[100002],rang[100002];

int get_parent(int x)
{
    int pr;
    for(pr=x;parent[pr]!=pr;pr=parent[pr]);

    while(parent[x] != x)
    {
        int y = parent[x];
        parent[x] = pr;
        x = y;
    }

    return pr;
}


void join(int x,int y)
{
    int parent_x=get_parent(x);
    int parent_y=get_parent(y);
    if (rang[parent_x] > rang[parent_y])
        parent[parent_x]=parent_y;
    else parent[parent_y]=parent_x;

    //if (rang[x] == rang[y]) rang[y]++;
}

int find(int x,int y)
{
    int parent_x=get_parent(x);
    int parent_y=get_parent(y);

    return parent_x==parent_y;
}

void citire()
{
    scanf("%d %d ",&N,&M);
    for(int i=1;i<=N;i++)
        parent[i]=i,rang[i]=1;
    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;
}