#include <fstream>

using namespace std;

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

int n, m, tata[100001], rg[100001];

inline void unite(int x, int y)
{
    if (rg[x] > rg[y])
        tata[y] = x;
    else
        tata[x] = y;
    if (rg[x] == rg[y])
        ++rg[y];
}

inline int Find(int x)
{
    int r = x;
    while (r != tata[r])
        r = tata[r];
    for (; tata[x] != x;)
    {
        tata[x] = r;
        x = tata[x];
    }
    return r;
}

int main()
{
    int p, x, y;
    in >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        tata[i] = i;
        rg[i] = 1;
    }
    for (int i = 1; i <= m; ++i)
    {
        in >> p >> x >> y;
        if (p == 1)
            unite(Find(x), Find(y));
        else
        {
            if (Find(x) == Find(y))
                out << "DA";
            else
                out << "NU";
            out << '\n';
        }
    }
}