#include <fstream>
#include <cstring>

using namespace std;

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

const int NMAX = 100005;

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

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

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

int main()
{
    fin >> n >> m;
    memset(par, 0, sizeof(par));
    memset(ht, 1, sizeof(ht));
    for (int i = 0; i < m; ++ i)
        {
         int t, x, y;
         fin >> t >> x >> y;
         if (t == 1)
            unite(root(x), root(y));
         else
            fout << (root(x) == root(y) ? "DA\n" : "NU\n");
        }
    fin.close();
    fout.close();
    return 0;
}