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

ifstream in("disjoint.in");
ofstream out("disjoint.out");

const int N_max = 100002;

int tata[N_max];
int h[N_max];

int N, M;

int FIND(int x) // RETURNEAZA RADACINA NODULUI x
{
    int r, y;

    r = x;

    while(tata[r] != r) r = tata[r];

    while(tata[x] != x)
    {
        y = tata[x];

        tata[x] = r;

        x = y;
    }

    return r;
}

void UNION(int x, int y) // REUNESTE ARBORELE DIN CARE FACE PARTE NODUL x CU ARBORELE DIN CARE FACE PARTE NODUL y
{
    int a = FIND(x);
    int b = FIND(y);

    if(h[a] < h[b]) tata[a] = b;
    else
    {
        tata[b] = a;

        if(h[a] == h[b]) h[a]++;
    }
}

int main()
{
    int i, cod, x, y, a, b;

    in >> N >> M;

    for(i = 1; i <= N; i++) tata[i] = i;

    for(i = 1; i <= M; i++)
    {
        in >> cod >> x >> y;

        if(cod == 1)
        {
            UNION(x, y);
        }
        else
        {
            a = FIND(x);
            b = FIND(y);

            if(a != b) out << "NU\n";
            else
                out << "DA\n";
        }
    }

    return 0;
}