#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
#define MAX 100010
#define cout fout
int mul[MAX], n, m, i, t, x, y;

int dad(int nod)
{
    if(nod != mul[nod])
        mul[nod] = dad(mul[nod]);
    return mul[nod];
}

int main()
{
    fin >> n >> m;
    for(i = 1 ; i <= n ; i++)
    {
        mul[i] = i;
    }
    while(m--)
    {
        fin >> t >> x >> y;
        if(t == 1)
        {
            mul[dad(x)] = dad(y);
        }
        else
        {
            if(dad(x) == dad(y))
                cout << "DA\n";
            else
                cout << "NU\n";
        }
    }
}