#include <iostream>
#include <fstream>

using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int card[100001], rad[100001];
int findd(int nod)
{
    if(rad[nod] == nod)
        return nod;
    return rad[nod] = findd(rad[nod]);
}
void Union(int a, int b)
{
    if(a == b)
        return;
    if(card[a]>=card[b])
        card[a] += card[b], rad[b] = a;
    else
        card[b] += card[a], rad[a] = b;
}
int main()
{
    int n, m;
    fin >> n >> m;
    for(int i = 1; i<=n; i++)
        rad[i] = i ,card[i] = 1;
    for(int i = 1; i<=m; i++)
    {
        int taptap, b, a;
        fin >> taptap >> a >> b;
        if(taptap == 1)
        {
            if(findd(a) != findd(b))
            Union(findd(a), findd(b));
        }
        else
        {
            if(findd(a) == findd(b))
                fout << "DA" << '\n';
            else fout << "Nu" << '\n';
        }
    }
    return 0;
}