#include <iostream>
#include <fstream>
#define Nmax 100005

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, cod, x, y, p[Nmax];
int parinte(int nod)
{
    if(p[nod] == nod)return nod;
    return p[nod] = parinte(p[nod]);
}
void un(int nod1, int nod2)
{
    p[parinte(nod1)] = parinte(nod2);
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)p[i] = i;
    for(int i = 1; i <= m; i++)
    {
        fin >> cod >> x >> y;
        if(cod == 1)
        {
            if(parinte(x) != parinte(y))
                un(x, y);
        }
        else
            if(parinte(x) == parinte(y))
                fout << "DA\n";
            else fout << "NU\n";
    }
    return 0;
}