#include <fstream>
#define MAX 100005
using namespace std;
ifstream fi("disjoint.in");
ofstream fo("disjoint.out");

int n,m;
int p[MAX];

int parinte(int nod)
{
    if (p[nod]==nod)
        return nod;
    return p[nod]=parinte(p[nod]);
}

int main()
{
    fi>>n>>m;
    for (int i=1; i<=n; i++)
        p[i]=i;
    for (int i=1; i<=m; i++)
    {
        int cod,x,y;
        fi>>cod>>x>>y;
        if (cod==1)
        {
            p[parinte(x)]=parinte(y);
        }
        else
        {
            if (parinte(x)==parinte(y))
                fo<<"DA\n";
            else
                fo<<"NU\n";
        }
    }
    return 0;
}