#include <fstream>

using namespace std;

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

const int NMAX = 100005;
int tata[NMAX],rang[NMAX];

int n,m;

int Find(int x)
{
    int r = x,y;

    while(tata[r] != r)
        r = tata[r];

    while(tata[x]!=x)
    {
        y = tata[x];
        tata[x] = r;
        x = y;
    }
    return r;
}

void Union(int x, int y)
{
    if(rang[x] > rang[y])
        tata[y] = tata[x];
    else
        tata[x] = tata[y];
    if(rang[x] == rang[y])
        rang[y]++;
}

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

    for(i=1;i<=m;++i)
    {
        fin >> query >> x >> y;
        if(query == 2)
        {
            if(Find(x) == Find(y))
                fout << "DA\n";
            else
                fout << "NU\n";
        }
        else
        {
            if(Find(x) != Find(y))
                Union(Find(x),Find(y));
        }
    }
    return 0;
}