#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
struct padure
{
    int t, h;
};
vector<padure>v;//t e vectorul de tati, h vectorul de inaltimi(adica de la fiecare element la capat
int varf(int x)
{
    while(x!=v[x].t)
        x = v[x].t; //caut varful, si ma opresc cand gasesc un element care este propriul lui tata
    return x;
}

void unire(int x, int y)
{
    //x, y sunt radacinile arborilor
    if(v[x].h == v[y].h)
    {
        v[x].h++;
        v[y].t = x;
    }
    else
    {
        if(v[y].h < v[x].h)
            v[y].t = x;
        else
        {
           v[x].t = y;//t[x] = tatal lui x, adica cel de deasupra
        }
    }
}

int main()
{
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    int n, m, i, x, y, c;
    fin>>n>>m;
    padure temp;
    temp.h = 1;
    for(i = 0; i<=n; i++)
    {
        temp.t = i;
        v.push_back(temp);
    }
    for(i = 1; i<=m; i++)
    {
        fin>>c>>x>>y;
        if(c == 1 )
        {
            if(varf(x) !=varf(y))
               unire(varf(x), varf(y));// unesc doi arbori(reunesc multimile), doar daca nu sunt deja in aceeasi multime
        }
       /* else
        {
            if(varf(x) == varf(y))//daca doua multimi au acelasi varf
                fout<<"DA"<<endl;
            else
                fout<<"NU"<<endl;
        }*/
        else
            fout<<(varf(x)==varf(y)?"DA\n":"NU\n");
    }
    fin.close();
    fout.close();
    return 0;
}