#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");

struct padure
{
    int n;
    vector<int> tat;
    padure(int a): n(a), tat(a)
    {
        for(int i = 0; i < n; ++i)
            tat[i] = i;
    }

    int find_tat(int nod)
    {
        if(tat[nod] == nod)
            return nod;
        else
            return find_tat(tat[nod]);
    }

    void find_r(int x, int y)
    {
        if(find_tat(x) == find_tat(y))
            out << "DA\n";
        else
            out << "NU\n";
    }

    void union_nod(int x, int y)
    {
        tat[y] = find_tat(x);
    }

};


int main()
{


    if(!in)
        cout << "eroare";
    int n, m, b, x, y;

    in >> n >> m;
    padure P(n);
    for(int i = 0; i < m; ++i)
    {
        in >> b >> x >> y;
        x--;
        y--;
        if(b == 1)
            P.union_nod(x, y);
        if(b == 2)
            P.find_r(x, y);
    }
    in.close();
    out.close();
}