#include <bits/stdc++.h>
#define NMAX 100001

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int n, m, a[NMAX];

int Search(int x)
{
    int k, p;

    k = x;
    while(a[k]!=k)
    {
        k = a[k];
    }

    while(x!=k)
    {
        p = a[x];
        a[x] = k;
        x = p;
    }

    return k;

}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++) a[i] = i;
    for(int i = 1; i <= m; i++)
    {
        int cod, x, y;
        fin >> cod >> x >> y;
        if(cod == 2)
        {
            if(Search(x) == Search(y))
                fout << "DA" << '\n';
            else
                fout << "NU" << '\n';
        }
        else
        {

            a[Search(x)] = Search(y);
        }

    }
    return 0;
}