#include <fstream>

using namespace std;

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

const int NMAX = 100000 + 5;

int N, M;
int dad[NMAX], rnk[NMAX];

int GetRoot(int node)
{
    int initNode = node, p = dad[node];

    while(node != p)
    {
        node = p;
        p = dad[p];
    }

    dad[initNode] = p;
    return p;
}

void Join(int x, int y)
{
    int p = GetRoot(x), q = GetRoot(y);

    if(rnk[p] == rnk[q])
    {
        rnk[p]++;
        dad[q] = p;
    }
    else if(rnk[p] > rnk[q])
        dad[q] = p;
    else
        dad[p] = q;
}

int main()
{
    fin >> N >> M;

    for(int i = 1; i <= N; i++)
        dad[i] = i;

    int type, x, y;

    for(int i = 1; i <= M; i++)
    {
        fin >> type >> x >> y;

        if(type == 1)
            Join(x, y);
        else
        {
            if(GetRoot(x) == GetRoot(y))
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }

    return 0;
}