#include <bits/stdc++.h>

using namespace std;

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

int n, m;
vector<int> TT, RR;

void Union(int x, int y)
{
    if (RR[x] >= RR[y]) /// union by rank
        TT[y] = x;
    else
        TT[x] = y;

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

int FindT(int x)
{
    int aux = x;
    for (; TT[aux] != aux; aux = TT[aux]);

    int c;
    for (; TT[x] != x; c = x, x = TT[x], TT[c] = aux);
    return aux;
}

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

    TT.resize(n + 1);
    RR.resize(n + 1);

    for (int i = 1; i <= n; ++i)
    {
        TT[i] = i;
        RR[i] = 1;
    }

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

        if (op == 1)
        {
            Union(FindT(x), FindT(y));
        }
        else
        {
           if (FindT(x) == FindT(y))
                fout << "DA\n";
           else
                fout << "NU\n";
        }
    }

    return 0;
}