#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int nmax=100000;
int tt[nmax+5];
int n,m;
int root(int x){
    while(x!=tt[x])
        x=tt[x];
    return x;
}
void unite(int x, int y){
    tt[y]=x;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        tt[i]=i;
    for(int i=1;i<=m;i++){
        int cod,x,y;
        fin>>cod>>x>>y;
        if(cod==1)
            unite(root(x),root(y));
        if(cod==2)
            if(root(x)==root(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
    }
    return 0;
}