#include <bits/stdc++.h>

using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,cod,x,y;
int t[100005];
int tata(int nod)
{
    if(t[nod]==nod)
        return nod;
    t[nod]=tata(t[nod]);
    return t[nod];
}
void join(int x, int y)
{
    x=tata(x);
    y=tata(y);
    t[x]=y;
}

int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(int i=0;i<m;i++)
    {
        in>>cod>>x>>y;
        if(cod==1)
            join(x,y);
        else
        {
            if(tata(x)==tata(y))
                out<<"DA\n";
            else
                out<<"NU\n";
        }
    }
}