#include <fstream>
#define NMAX 100002

using namespace std;

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

int n, m;
int tata[NMAX];
int h[NMAX];

int Find(int x);
void Union(int x, int y);

int main()
{
    int cod, x, y;

    fin>>n>>m;
    while(m--)
    {
        fin>>cod>>x>>y;
        if(cod == 1)
            Union(x, y);
        else
        {
            if(Find(x) == Find(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}


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

    while(tata[rad]) rad = tata[rad];

    while(tata[x])
    {
        y = tata[x]; tata[x] = rad;
        x = y;
    }

    return rad;
}

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