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

using namespace std;

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

int n, m;
vector<int> tata;

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

int main()
{
    int i, op, x, y;
    fin >> n >> m;
    tata.resize(n+1);
    for(i = 1; i <= n; i++)
        tata[i] = i;

    for(i = 1; i <= m; i++)
    {
        fin >> op >> x >> y;
        if(op == 1)
            tata[radacina(y)] = radacina(x);
        else if(op == 2)
        {
            if(radacina(x) == radacina(y)) fout << "DA \n";
            else fout << "NU \n";
        }
    }
    return 0;
}