#include <fstream>
using namespace std;

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

void ReadFunction();
void Init();
void Union(int r1, int r2);
int Find(int nod);

const int maxn = 100001;

int n, m, t[maxn], r[maxn];

int main()
{
    ReadFunction();
}

void ReadFunction()
{
    fin >> n >> m;
    Init();
    for (int i = 1, x, y, z; i <= m; ++i)
    {
        fin >> x >> y >> z;
        if (x == 1)
        {
            Union(y, z);
        }
        else
        {
            if (Find(y) == Find(z))
                fout << "DA" << '\n';
            else
                fout << "NU" << '\n';
        }
    }
}

void Init()
{
    for (int i = 1;i <= n; ++i)
        t[i] = i;
}

void Union(int r1, int r2)
{
    if (r[r1] < r[r2]) t[r1] = r2;
    else
    {

        t[r2] = r1;
    if (r[r1] == r[r2]) r[r1]++;

    }
}
int Find(int nod)
{
    if (t[nod] != nod)
        t[nod] = Find(t[nod]);
    return t[nod];
}