#include <bits/stdc++.h>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int nMax = 100003;
int Tata[nMax];
int n, m, a, b, op;
inline void Union (int x, int y) {
    for(int i=1;i<=n;i++)
        if(Tata[i]==Tata[x])
          Tata[i]=y;

}
inline int Find(int x) {
    if(Tata[x] != x) {
        Tata[x] = Find(Tata[x]);
    }
    return Tata[x];
}
int main()
{ int i;

    f >> n >> m;
    for(int i = 1; i <= n; i++) {
        Tata[i] = i;
    }
    for(int i = 1; i <= m; i++) {
        f >> op >> a >> b;
        int x = Find(a);
        int y = Find(b);
        if(op == 1) {
                if(Tata[x]<Tata[y])
            Union(x, y);
        else
            Union(y,x);
        }
        else {
            if(x == y) {
                g << "DA\n";
            }
            else {
                g << "NU\n";
            }
        }

    }
   // for(i=1;i<=n;i++)
     //   g<<Tata[i]<<'\n';
    return 0;
}