#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,tata[100001],op,x,y;
int rad(int nod){
    while(tata[nod]!=nod)
        nod=tata[nod];
    return nod;
}
void uneste(int x,int y){
    int tataX = rad(x);
    int tataY = rad(y);
    tata[tataY]=tataX;
}
int main(){
    f>>n>>m;
    for (int i = 1; i < n; ++i) {
        tata[i]=i;
    }
    for (int i = 0; i < m; ++i) {
        f>>op>>x>>y;
        if(op == 1){
            uneste(x,y);
        }
        else{
            if(rad(x)!= rad(y))
                g<<"NU\n";
            else
                g<<"DA\n";
        }
    }

    return 0;
}