#include <iostream>
#include <fstream>

using namespace std;

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

int n, t;
int father[100100], depth[100100];

int root(int node)
{
    int x = node;

    while(father[x] != 0)
        x = father[x];

    return x;
}

void connect(int x, int y)
{
    if(depth[x] > depth[y])
        father[x] = y;

    if(depth[x] < depth[y])
        father[y] = x;

    if(depth[x] == depth[y])
    {
        father[x] = y;
        depth[x]++;
    }
}

int main()
{
    in >> n >> t;

    while(t--)
    {
        int q, x, y;
        in >> q >> x >> y;

        if(q == 1)
            connect(root(x), root(y));
        else
            out << (root(x) == root(y) ? "DA\n" : "NU\n");
    }

    return 0;
}