#include <cstdio>
#define Nmax 100005
using namespace std;
int father[Nmax];
int n,m;

int searched(int x)
{
    while(x!= father[x])
        x = father[x];
    return x;
}
void read()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d %d",&n,&m);
    int a,b,task;
    for(int i = 1; i <= n ; i++)
        father[i] = i;
    for(int i = 0 ; i < m ; i++)
    {
        scanf("%d %d %d",&task,&a,&b);
        if(task == 2)
        {
            if(searched(a) == searched(b))
                printf("DA\n");
            else
                printf("NU\n");
        }
        else
        {
            int radacina = searched(b);
            father[radacina] = searched(a);
        }
    }
}

int main()
{
    read();
    return 0;
}