#include <fstream>
#include <vector>
using namespace std;
int get_radacina(int x, const vector<int> &tati)
{
    while(tati[x] != -1)
        x = tati[x];
    return x;
}
void reuniune(int x, int y, vector<int> &tati, vector<int> &inaltimi)
{
    int rad1 = get_radacina(x, tati);
    int rad2 = get_radacina(y, tati);
    if(inaltimi[rad1] > inaltimi[rad2])
    {
        tati[rad2] = rad1;
    }
    else
    {
        tati[rad1] = rad2;
        if(inaltimi[rad1] == inaltimi[rad2])
        {
            inaltimi[rad2]++;
        }
    }
}
int main()
{
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    int n, m;
    f >> n >> m;
    vector<int> tati(n+1, -1);
    vector<int> inaltimi(n+1, 0);

    int operatie, x, y;

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

        if(operatie == 1)
        {
            reuniune(x, y, tati, inaltimi);
        }
        else
        {
            if(get_radacina(x, tati) == get_radacina(y, tati))
            {
                g << "DA\n";
            }
            else
            {
                g << "NU\n";
            }
        }
    }
    return 0;
}