#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");

int tata[100001], rang[100001];

int radacina(int nod)
{
    if (tata[nod] == nod)
        return nod;
    return radacina(tata[nod]);
}

void arbore(int a, int b)
{
    if(rang[a] > rang[b])
        tata[b] = a;
    else tata[a] = b;
    if(rang[a] == rang[b]) rang[b]++;
}

int n, m;

int main()
{
    f>>n>>m;

    for(int i = 1; i <= n; i++)
    {
        rang[i] = 1;
        tata[i] = i;
    }

    int x, y, optiune;

    for(int i = 1; i <= m; i++)
    {
        f>>optiune>>x>>y;

        if(optiune == 2)
        {
            if (radacina(x) == radacina(y))
                g<<"DA\n";
            else g<<"NU\n";
        }
        else
        {
            arbore(radacina(x), radacina(y));
        }
    }

}