#include<bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int N,M,tip,x,y,P[100001],T[100001];
int Root(int x){
    while(x!=T[x])x=T[x];
    return x;
}
void Unifica(int x,int y){
    if(P[x]>P[y])T[y]=x;
    else if(P[x]<P[y])T[x]=y;
    else ++P[x],T[y]=x;
}
int main()
{
    f>>N>>M;
    for(int i=1;i<=N;++i)T[i]=i;
    while(M--){
        f>>tip>>x>>y;
        int rx=Root(x);
        int ry=Root(y);
        if(tip==1)Unifica(rx,ry);
        else{
            if(rx==ry)g<<"DA\n";
            else g<<"NU\n";
        }
    }
    return 0;
}