#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");

int N, M, dad[100005], tip, x, y;

int grupa(int nod)
{
    if (dad[nod]==nod) return nod;
    return grupa(dad[nod]);
}

void unite(int x, int y)
{
    dad[grupa(x)]=grupa(y);
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=N; ++i)
        dad[i]=i;
    while (M--)
    {
        f>>tip>>x>>y;
        if (tip==1) unite(x, y);
            else
            {
                if (grupa(x)==grupa(y)) g<<"DA\n";
                    else g<<"NU\n";
            }
    }
    return 0;
}