#include <iostream>
#include <fstream>
using namespace std;


#define NMAX 100001

int n, q, tata[NMAX];
ifstream f("disjoint.in");
ofstream g("disjoint.out");

int get_tata(int x)
{
    int p;
    for(p=x;p!=tata[p];p=tata[p]);


    while(tata[x]!=x)
    {
        int y = tata[x];
        tata[x]=p;
        x=y;

    }
    return p;
}

int main()
{
    f>>n>>q;
    for(int i=1;i<=n;i++)
        tata[i]=i;
    while(q--)
    {
        int query, a, b;
        f>>query>>a>>b;
        if(query==1)
        {
            tata[get_tata(a)]=get_tata(b);
        }
        else
        {
            g<<((get_tata(a)==get_tata(b))?"DA":"NU")<<'\n';
        }
    }
    return 0;
}