#include <bits/stdc++.h>

using namespace std;

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

int n, m;

int parent[100001];

int Find(int nod)
{
    while(parent[nod] != 0)
    {
        nod = parent[nod];
    }
    return nod;
}

void Union(int nod1, int nod2)
{
    parent[nod2] = nod1;
}

int main()
{
    in >> n >> m;
    for(int te = 1; te <= m; te++)
    {
        int op, x, y;
        in >> op >> x >> y;
        if(op == 1)
        {
            int a = Find(x), b = Find(y);
            if(a != b)
            {
                Union(a, b);
            }
        }
        else if(op == 2)
        {
            if(Find(x) == Find(y))
                out << "DA\n";
            else
                out << "NU\n";
        }
    }
    return 0;
}