#include <fstream>

using namespace std;

ifstream cin ("disjoint.in");
ofstream cout ("disjoint.out");

const int NMAX=1e5;

int sef[NMAX+1];

int sef_suprem(int nod)
{
    if (sef[nod]==nod)
        return nod;
    return sef[nod]=sef_suprem(sef[nod]);
}
void unire(int x, int y)
{
    int sefx=sef_suprem(x);
    int sefy=sef_suprem(y);
    sef[sefx]=sefy;
}
int main()
{
    int n,m,i,tip,x,y;
    cin>>n>>m;
    for (i=1; i<=n; i++)
        sef[i]=i;
    for (i=1; i<=m; i++)
    {
        cin>>tip>>x>>y;
        if (tip==1)
        {
            unire(x, y);
        }
        else
        {
            if (sef_suprem(y)==sef_suprem(x))
                cout<<"DA"<<'\n';
            else
                cout<<"NU"<<'\n';
        }
    }
    return 0;
}