#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int parinte[100001];

int cautare_parinte(int x)
{
    if (parinte[x]==x)
        return x;
    else
        return parinte[x]=cautare_parinte(parinte[x]);
}
int main()
{
    int n, m;
    fin >> n >> m;
    for (int i=1; i<=n; i++)
        parinte[i]=i;
    for (int i=1; i<=m; i++)
    {
        int x,y;
        int cerinta;
        fin >> cerinta;
        fin >> x >> y;
        if (cerinta==1)
        {
            parinte[cautare_parinte(x)]=cautare_parinte(y);
        }
        else
        {
            if (cautare_parinte(x)==cautare_parinte(y))
                fout << "DA" <<'\n';
            else
                fout << "NU" <<'\n';
        }
    }
}