#include <fstream>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int cod,x,y,n,m,i,R[100001];

int T(int k){ int p;
    if(R[k]==k) return k;
    else {p = T(R[k]); R[k] = p; return p;}
}

int main()
{
    f >> n >> m;
    for(i=1;i<=n;i++)
        R[i] = i;
    for(i=1;i<=m;i++){
        f >> cod >> x >> y;
        if(cod==1) R[max(x,y)]=R[min(x,y)];
        else if(T(x)==T(y)) g << "DA\n";
        else g << "NU\n";}

    return 0;
}