#include <fstream>
using namespace std;

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

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

const int PM = 100005;
int n, m, t[PM];

int main()
{
    int x, y, q;
    fin >> n >> m;

    for (int i = 1; i <= n; ++i)
        t[i] = i;

    for (int i = 1; i <= m; ++i)
    {
        fin >> q >> x >> y;

        if (q == 1)
            Union(x, y);
        else
            if (Find(x) == Find(y))
                fout << "DA\n";
            else
                fout << "NU\n";
    }
}

int Find(int x)
{
    if (x == t[x])
        return x;
    return t[x] = Find(t[x]);
}

void Union(int x, int y)
{
    int r1, r2;
    r1 = Find(x);
    r2 = Find(y);

    if (r1 != r2)
        t[r1] = r2;
}