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

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

int n, m, cod, x, y;
vector<int> tata;
vector<int> rang;

int cautaRadacina(int n){
    while(tata[n] != n){
        tata[n] = tata[tata[n]];
        n = tata[n];
    }

    return n;
}

void reuniune(int& x, int& y){
    int a = cautaRadacina(x);
    int b = cautaRadacina(y);

    if(rang[a] > rang[b])
        tata[b] = a;
    else
        tata[a] = b;
}

void afisare(int& x, int& y){
    if (cautaRadacina(x) == cautaRadacina(y))
        fout<<"DA"<<"\n";
    else
        fout<<"NU"<<"\n";
}

int main(){

    fin>>n>>m;
    tata.resize(n+1);
    rang.resize(n+1);
    for(int i=1; i<=n; i++){
        tata[i] = i;
        rang[i] = 1;
    }

    for(int i=1; i<=m; i++){
        fin>>cod>>x>>y;
        if(cod == 1)
            reuniune(x,y);
        else
            afisare(x,y);
    }

}