#include <bits/stdc++.h>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int Nmax = 100000 + 5;
int p[Nmax], n , m;
int parinte(int nod)
{
    if(p[nod] == nod)return nod;
    return p[nod] = parinte(p[nod]);
}
int main()
{
    fin >> n >> m;
    for(int i =1 ; i <= n; ++i)
        p[i] = i;
    for(int i = 1, a, b , c; i <= m; ++i)
    {
        fin >> a >> b >> c;
        if(a == 1)
            p[parinte(b)] = parinte(c);
        else
        {
            if(parinte(b) == parinte(c))fout << "DA\n";
            else fout << "NU\n";
        }
    }
    return 0;
}