#include <fstream>
#include <cstdio>
using namespace std;
int t[100010],ce,x,y,rang[100010],m,n,i;
int find(int x){
    if(x==t[x])return x;
    else t[x]=find(t[x]);}
int reunire(int x,int y){
    x=find(x);
    y=find(y);
    if(rang[x]>rang[y])t[y]=x;
    else
    if(rang[y]>rang[x])t[x]=y;
    else {
        rang[x]++;t[y]=x;}}
int main()
{
    freopen("disjoint.in","r",stdin);
    ofstream g ("disjoint.out");
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++){
    t[i]=i;rang[i]=1;}
    for(i=1;i<=m;i++){
    scanf("%d%d%d",&ce,&x,&y);
    if(ce==1)reunire(x,y);
    else if(find(x)==find(y))g<<"DA"<<'\n';
    else g<<"NU"<<'\n';}
    return 0;}