#include <bits/stdc++.h>

using namespace std;

int boss(int a, int sef[])
{
    if (sef[a] == a)
        return a;
    else
    {
        while (sef[a] != a)
            return sef[a] = boss(sef[a], sef);
    }
}

void unire(int a, int b, int sef[])
{
    int boss1 = boss(a, sef);
    int boss2 = boss(b, sef);
    sef[boss2] = boss1;
}

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

    int n, m, cod, x, y, i;
    fin >> n >> m;
    int sef[n+1];
    for (i = 1; i <= n; i++)
        sef[i] = i;
    for (i = 1; i <= m; i++)
    {
        fin >> cod >> x >> y;
        if (cod == 1)
        {
            unire(x, y, sef);
        }
        else
        {
            if (boss(x, sef) == boss(y, sef))
                fout << "DA" << endl;
            else fout << "NU" << endl;
        }
    }

    fin.close();
    fout.close();
    return 0;
}