#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

vector <int> tata(100001);

int root(int node)  //urcam recursiv in arbore pana gasim radacina
{
    if(tata[node] != node)
        return root(tata[node]);

    return node;
}

int main()
{
    int n, m, i, cod, x, y;

    f >> n >> m;
    tata.resize(n+1);

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

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

        if(cod == 1)
            tata[root(x)] = root(y);
        else if(root(x) == root(y)) //daca au aceeasi radacina => sunt in acelasi arbore
            g << "DA\n";
        else
            g << "NU\n";
    }

    return 0;
}