#include <fstream>
#include <vector>

using namespace std;

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

int n, m;
vector<int> parinte, rang;

int gaseste_parinte(int x)
{
    // Gaseste parintele unui nod, facand in acelasi timp si compresia drumului.

    if (parinte[x] != x)
        parinte[x] = gaseste_parinte(parinte[x]);

    return parinte[x];
}

void uneste_multimi(int x, int y)
{
    x = gaseste_parinte(x);
    y = gaseste_parinte(y);

    if (rang[x] > rang[y])
        parinte[y] = x;
    else if (rang[x] < rang[y])
        parinte[x] = y;
    else
    {
        parinte[y] = x;
        rang[x]++;
    }
}

int main()
{
    fin >> n >> m;

    parinte.resize(n + 1, 0);
    rang.resize(n + 1, 0);

    for (int i = 1; i <= n; i++)
        parinte[i] = i;

    for (int i = 1; i <= m; i++)
    {
        int c, x, y;
        fin >> c >> x >> y;

        if (c == 1)
        {
            uneste_multimi(x, y);
        }
        else
        {
            if (gaseste_parinte(x) == gaseste_parinte(y))
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }

    return 0;
}