#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int N,M,x,y,tip,T[100001],P[100001];
int Find(int x){
int rad=x;
while(T[rad])rad=T[rad];
int tmp;
while(T[x]){
tmp=T[x];
T[x]=rad;
x=tmp;
}
return rad;
}
void Reunire(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;
while(M--){
f>>tip>>x>>y;
if(tip==1){
if(Find(x)!=Find(y))
Reunire(x,y);
}else{
if(Find(x)==Find(y))g<<"DA\n";
else g<<"NU\n";
}
}
return 0;
}