#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int sef[100001];
int sef_suprem(int nod){
    if(sef[nod] == nod){
        return nod;
    }
    return sef[nod]= sef_suprem(sef[nod]);
}
void unire(int x, int y){
    int sefx = sef_suprem(x);
    int sefy = sef_suprem(y);
    sef[sefx] = sefy;
}
int main()
{
    int n, m, cod, x, y;
    fin >> n >> m;
    for(int i = 1 ; i <= n ; i++){
        sef[i] = i;
    }
    for(int i = 1;i <= m ; i++){
        fin >> cod >> x >> y;
        if(cod == 1){
            unire(x, y);
        }
        else{
            if(sef_suprem(x) == sef_suprem(y)){
                fout << "DA" << "\n";
            }
            else fout << "NU" << "\n";
        }
    }
    return 0;
}