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


#define NMAX 100001

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

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)
        {
            int t = tata[b];
            while(t!=tata[t])
                t=tata[t];
            tata[a]=t;
        }
        else
        {
            g<<((tata[a]==tata[b])?"DA":"NU")<<'\n';
        }
    }
    return 0;
}