#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
vector<int>t, h;//t e vectorul de tati, h vecotrul de inaltimi
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int varf(int x)
{
    while(x!=t[x])
        x = t[x];
    return x;
}
void unire(int x, int y)
{
    //x, y sunt radacinile arborilor
    if(h[x] > h[y])
        t[y] = x;//t[x] = tatal lui x, adica cel de deasupra
    else
    {
        if(h[y] > h[x])
            t[x] = y;
        else
        {
            h[x]++;
            t[y] = x;
        }
    }
}
int main()
{
    int n, m, i, x, y, ty, tx, c;
    fin>>n>>m;
    for(i = 0; i<=n; i++)
    {
        t.push_back(i);
        h.push_back(1);
    }
    /*for(i = 1; i<=m; i++)
    {
        cin>>x>>y;
        tx = findset(x);
        ty = findset(y);
        if(tx!=ty)
        {
            unionset(tx, ty);//unific 2 arbori cu
        }
    }*/
    for(i = 1; i<=m; i++)
    {
        fin>>c>>x>>y;
        if(c == 1 && varf(x)!=varf(y))
        {
            unire(varf(x), varf(y));// unesc doi arbori(reunesc multimile
        }
        if(c == 2)
        {
            if(varf(x) == varf(y))//daca doua multimi au acelasi varf
                fout<<"DA"<<endl;
            else
                fout<<"NU"<<endl;
        }
    }
    return 0;
}