#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int gaseste_radacina(int nod, vector<int>& tata)
{
    if(tata[nod] == nod)
        return nod;
    else
    {
        int c = nod, x;
        vector<int> temp;
        while(tata[c] != c)
        {
            c = tata[c];
            temp.push_back(c);
        }

        for(int i:temp)
        {
            tata[i] = c;
        }

        return c;
    }
}
int main()
{
    int n,m,a,b,c;
    vector<vector<int>> list;
    vector<int> tata, rang;
    fin>>n>>m;
    for(int i=0;i<=n;i++)
    {
        tata.push_back(i);
        rang.push_back(1);
        list.push_back({});
    }
    for(int x=1;x<=m;x++)
    {
        fin>>a>>b>>c;
        if(a == 1)
        {
            if(rang[b]<rang[c])
                tata[b] = c;
            else
                tata[c] = b;
            if(rang[b] == rang[c])
                rang[c]++;
        }
        else
        {

            if(gaseste_radacina(b,tata) == gaseste_radacina(c,tata))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }

    }
    fin.close();
    fout.close();
    return 0;
}