#include <iostream>
#include <fstream>

using namespace std;

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

int arb[100001], rang[100001];

void unite(int x, int y)
{
    if(rang[x] > rang[y])
        arb[y] = x;
    else
        arb[x] = y;

    if(rang[x] == rang[y])
        rang[y] ++;
}

int find(int x)
{
    int i, y;
    for(i = x; arb[i] != i; i = arb[i]);

    for(; arb[x] != x;)
        {
            y = arb[x];
            arb[x] = i;
            x = y;
        }

    return i;
}

int main()
{
    int n, m, x, y, i, op;
    f>>n>>m;

    for(i=1; i<=n; i++)
    {
        arb[i] = i;
        rang[i] = 1;
    }


    for(i=1; i<=m; i++)
    {
        f>>op>>x>>y;

        if(op == 2)
        {
            if(find(x) == find(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }

        else if(op == 1)
        {
            unite(find(x), find(y));
        }
    }
}