#include <bits/stdc++.h>
#define nmax 32002
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m;
int T[100002],R[100002];
int Find(int x)
{   int rad=x;
    while(T[rad]!=rad) rad=T[rad];
    while(T[x]!=x) {int y=T[x]; T[x]=rad; x=y;}
    return rad;
}
void unire(int x, int y)
{   if(R[x]>R[y]) T[y]=x; else T[x]=y;
    if(R[x]==R[y]) R[y]++;
}
int main()
{   f>>n>>m;
    for(int i=1; i<=n; i++) {T[i]=i; R[i]=1;}
    for(int op,a,b; m; m--)
        {   f>>op>>a>>b;
            if(op==1) unire(Find(a),Find(b));
            if(op==2) if(Find(a)==Find(b)) g<<"DA\n"; else g<<"NU\n";
        }
    g.close();
    f.close();
    return 0;
}