#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int t[100005],m,n,cod,x,y;
int search(int nod)
{
    if(t[nod]!=nod)
    {
        int aux=search(t[nod]);
        t[nod]=aux;
        return aux;
    }
    return nod;
}
void join(int x, int y)
{
    t[search(x)]=search(y);
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(int i=0;i<m;i++)
    {
        f>>cod>>x>>y;
        if(cod==1)
            join(x,y);
        if(cod==2)
        {
            if(search(x)==search(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
    }
    f.close();g.close();
    return 0;
}