#include <iostream>
#include <fstream>

using namespace std;

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

int dad[100005], rnk[100005];
int n, m;

int doFind(int nod)
{
    if (dad[nod] != nod)
    {
        int x = doFind(dad[nod]);
        dad[nod] = x;
        return x;
    }
    else
    {
        return nod;
    }
}

void doUnion(int x, int y)
{
    int rx = doFind(x);
    int ry = doFind(y);
    if (rnk[rx] == rnk[ry])
    {
        rnk[rx]++;
        dad[ry] = rx;
    }
    else if (rnk[rx] < rnk[ry])
    {
        dad[rx] = ry;
    }
    else
    {
        dad[ry] = rx;
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        rnk[i] = 0;
        dad[i] = i;
    }
    for (int i = 0; i < m; i++)
    {
        int cod, x, y;
        fin >> cod >> x >> y;
        if (cod == 1)
        {
            doUnion(x, y);
        }
        else
        {
            int rx = doFind(x);
            int ry = doFind(y);
            if (rx == ry)
            {
                fout << "DA\n";
            }
            else
            {
                fout << "NU\n";
            }
        }
    }
    return 0;
}