#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <climits>

using namespace std;

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


vector<int> multimi;

int cauta_radacina(int x)
{
    while (multimi[x] != x) x = multimi[x];

    return x;
}

void reuneste(int x, int y)
{
    int tata = min(cauta_radacina(x), cauta_radacina(y));
    int copil = max(cauta_radacina(x), cauta_radacina(y));

    multimi[copil] = tata;
}
int main()
{
    int n, m;
    fin>>n>>m;

    multimi.resize(n+1);
    for (int i = 1; i <= n; i++) multimi[i] = i;

    for (int i = 1; i <= m; i++){
        int cod, x, y;
        fin>>cod>>x>>y;

        if (cod == 1){
            reuneste(x, y);
        }
        else{
            if (cauta_radacina(x) == cauta_radacina(y)) fout<<"DA"<<"\n";
            else cout<<"NU"<<"\n";
        }
    }

}