#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 nod)
{
    return (F[nod] < 0) ? nod : rad(F[nod]);
}

bool test( int node1, int node2 )
{
    return rad(node1) == rad(node2);
}

void add(int x, int y)
{
    if(x == y)
        return;
    if(-F[x] < -F[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 = 0; i < maxn; i++)
        F[i] = -1;
    for(int i = 1; i <= m; i++)
    {
        int op, x, y;
        in >> op >> x >> y;
        if(op == 1)
            add(x, y);
        else
        {
            if(test(x, y))
                out << "DA";
            else
                out << "NU";
            out << "\n";
        }
    }
    return 0;
}