#include <fstream>

using namespace std;

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

const int NMAX = 100000;

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

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

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

    dad[initNode] = p;
    return p;
}

void Join(int p, int q)
{
    p = Root(p);
    q = Root(q);

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

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

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

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

        if(t == 1)
            Join(x, y);
        else
            fout << ((Root(x) == Root(y)) ? "DA" : "NU") << '\n';
    }

    return 0;
}