#include <fstream>

using namespace std;

const int Nmax = 100000;
int x[Nmax + 1];

int jump(int node)
{
    if (x[node] == node)
    {
        return node;
    }
    return x[node] = jump(x[node]);
}

void unite(int node1, int node2)
{
    int parent1 = jump(node1);
    int parent2 = jump(node2);
    if (parent1 != parent2)
    {
        x[parent2] = parent1;
    }
}

int main()
{
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        x[i] = i;
    }
    while (m--)
    {
        int tip, a, b;
        fin >> tip >> a >> b;
        if (tip == 1)
        {
            unite(a, b);
        }
        else
        {
            if (jump(a) == jump(b))
            {
                fout << "DA\n";
            }
            else
            {
                fout << "NU\n";
            }
        }
    }
    return 0;
}