#include <fstream>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int NMAX = 100005;

int n, m;
int par[NMAX], ht[NMAX];

inline int root(int node)
{
    while (par[node])
        node = par[node];
    return node;
}

inline void unite(int a, int b)
{
    if (ht[a] > ht[b])
        par[b] = a;
    else
        {
         par[a] = b;
         if (ht[a] == ht[b])
            ++ ht[b];
        }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++ i)
        ht[i] = 1;
    for (int i = 0; i < m; ++ i)
        {
         int t, x, y;
         fin >> t >> x >> y;
         int a = root(x);
         int b = root(y);
         if (t == 1)
            unite(a, b);
         else
            if (a == b)
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    fin.close();
    fout.close();
    return 0;
}