#include<fstream>
#include<queue>
#include<vector>
#include<iostream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,i,j,a,b,c,w,x[111111];
int pr1(){
    int q;
    q=x[b];
    while(q!=x[q])
        q=x[q];
    return q;
}
int main(){
    fin>>n>>m;
    for(i=1;i<=n;i++)
        x[i]=i;
    for(w=1;w<=m;w++){
        fin>>c>>a>>b;
        if(c==1)
            x[b]=x[a];
        if(c==2){
            if(x[a]==pr1())
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}