#include <fstream>

using namespace std;

int tata[100002];

int find(int x) {
    int r=x;
    while(tata[r]!=r)
        r=tata[r];
    return r;
}

void uneste(int x,int y) {
    x=find(x);
    y=find(y);
    tata[x]=y;
}

int main() {
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    int n,i,m,tip,x,y;
    fin>>n>>m;
    for(int i = 1 ; i <= n ; ++ i)
        tata[i] = i;
    for(i=0; i<m; i++) {
        fin>>tip>>x>>y;
        if(tip==1)
            uneste(x,y);
        else {
            if(find(x)==find(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }

    fin.close();
    fout.close();
    return 0;
}