#include <iostream>
#include <fstream>
#define MAX 100001

using namespace std;

int dad[MAX];
int find_daddy(int nod)
{
    if(dad[nod] == nod)return nod;
    else
    {
        return dad[nod] = find_daddy(dad[nod]);
    }
}

void Union(int nod1, int nod2)
{
    dad[find_daddy(nod1)] = find_daddy(nod2);
}

int main()
{
    int n, m, tip, x, y, i;

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

    fin >> n >> m;

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

    for(i = 1; i <= m; i++)
    {
        fin >> tip >> x >> y;

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

    return 0;
}