#include <fstream>
#include <vector>

using namespace std;

ifstream fin;
ofstream fout;

vector <int> t, r;

int n, m;

void initializare()
{
    t.push_back(0x3f3f3f3f);
    r.push_back(0x3f3f3f3f);
    for(int i=1; i<=n; ++i)
        t.push_back(i), r.push_back(1);
}

int root(int x)
{
    int y;
    for(y=x; y!=t[y]; y=t[y]);
    while (x!=t[x])
    {
        int temp=t[x];
        t[x]=y;
        x=temp;
    }
    return y;
}

void Union(int x, int y)
{
    if (r[x] > r[y])
        t[y]=x;
    else
        t[x]=y;
    if (r[x]==r[y])
        ++r[y];
}

int main()
{
    fin.open("disjoint.in");
    fout.open("disjoint.out");

    fin >> n >> m;

    initializare();

    while(m)
    {
        --m;
        int cod;
        fin >> cod;
        if (cod==1)
        {
            int x, y;
            fin >> x >> y;
            Union(root(x), root(y));
        }
        else
        {
            int x, y;
            fin >> x >> y;
            if (root(x)==root(y))
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }

    return 0;
}