#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int P[100001];
int n,m;
int radacina(int nod)
{
    if(P[nod]==nod)
    return nod;
    else
        {
            P[nod]=radacina(P[nod]);
            return radacina(P[nod]);
        }
}
void reuniune(int a,int b)
{
    P[radacina(a)]=radacina(b);
}
int query(int a,int b)
{
    if(radacina(a)==radacina(b))
        return 1;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        P[i]=i;
    for(int i=1;i<=m;i++)
    {
        int cod,x,y;
        fin>>cod>>x>>y;
        if(cod==1)
            reuniune(x,y);
        else
        {
            if(query(x,y))
                fout<<"DA\n";
            else
                fout<<"NU\n";

        }
    }
    return 0;
}