#include <bits/stdc++.h>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int N = 100010;
int n,m,cod,x,y,rx,ry,t[N];
int root(int);
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(;m;m--)
    {
        f>>cod>>x>>y;
        rx=root(x);
        ry=root(y);
        if(cod==1)
            t[rx]=ry;
        else
        {
            if(rx==ry)
                g<<"DA\n";
            else
                g<<"NU\n";
        }
    }
    return 0;
}
int root(int nod)
{
    while(nod!=t[nod])
        nod=t[nod];
    return nod;
}