#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

vector <int>t;
vector <int>h;

int Find(int x)
{
    if(t[x] == 0)
        return x;

    return t[x] = Find(t[x]);
}

int main()
{
    int n, m, operatie, x, y;
    f>>n>>m;
    t.resize(n+1, 0);
    h.resize(n+1, 0);

    for(int i = 0; i < m; i++)
    {
        f>>operatie>>x>>y;

        if(operatie== 1)
        {

            int rad_x = Find(x);
            int rad_y = Find(y);

            t[rad_x] = rad_y;
        }
        else
        {
            if(Find(x) == Find(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
    }

    return 0;
}