#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int maxn = 100005;
int F[maxn];

int rad(int x)
{
    while(F[x] >= 0)
        x = F[x];
    return x;
}

void join(int x, int y)
{
    x = rad(x);
    y = rad(y);
    if(x == y)
        return;
    if(-F[x] < -F[y]) /// daca dimensiunea padurii lui x e < dimensiunea padurii lui y
    {
        F[y] += F[x];
        F[x] = y;
    }
    else
    {
        F[x] += F[y];
        F[y] = x;
    }
}

int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 1; i <= n; i++)
        F[i] = -1; /// fiecare nod este in padurea lui, tin in F[radacina] dimensiunea padurii
    for(int i = 1; i <= m; i++)
    {
        int op, x, y;
        in >> op >> x >> y;
        if(op == 1)
            join(x, y);
        else
        {
            if(rad(x) == rad(y))
                out << "DA\n";
            else
                out << "NU\n";
        }
    }
    return 0;
}