#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

int tata[100007];
int grad[100007];

int find_father(int nod)
{
    if(tata[nod]==nod)
        return nod;
    tata[nod]=find_father(tata[nod]);
    return tata[nod];
}

int main()
{
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    int n,m;
    f>>n>>m;
    for(int i=1; i<=n; i++)
    {
        tata[i]=i;
        grad[i]=1;
    }
    int op,a,b;
    for(int i=1; i<=m; i++)
    {
        f>>op>>a>>b;
        if(op==2)
        {
            if(find_father(a)==find_father(b))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
        else
        {
            if(find_father(a)!=find_father(b))
            {

                int A=find_father(a);
                int B=find_father(b);
                if(grad[A]<grad[B])
                {
                    tata[A]=B;
                    grad[B]+=grad[A];
                }
                else
                {
                    tata[B]=A;
                    grad[A]+=grad[B];
                }
            }
        }
    }
}