#include <fstream>
using namespace std;

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

int n, m;

int tata[100000], niv[100000];

int fnd(int x)
{
    int y = x, r = x;
    while(tata[r] != r)
    {
        r = tata[r];
    }
    while(tata[y] != y)
    {
        int z = tata[y];
        tata[y] = r;
        y = z;
    }
    return r;
}

void uni(int x, int y)
{
    int t1 = fnd(x), t2 = fnd(y);

    if(t1 != t2)
    {
        if(niv[t1] < niv[t2])
        {
            tata[t1] = t2;
        }
        else
        {
            tata[t2] = t1;
        }
        if(niv[t1] == niv[t2]){
            tata[t2] = t1;
            niv[t1]++;
        }
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        tata[i] = i;
        niv[i] = 1;
    }
    for(int i = 1; i <= m; i++)
    {
        short cod;
        int x, y;
        fin >> cod >> x >> y;

        if(cod == 2)
        {
            if(fnd(x) == fnd(y))
            {
                fout << "DA\n";
            }
            else{
                fout << "NU\n";
            }
        }
        else
        {
            uni(x, y);
        }
    }



    return 0;
}