#include <fstream>

using namespace std;

int rada[100010], rang[100010], n, m;

inline int find(int x)
{
    int y, rad;
    for (rad = x; rada[rad]!=0; rad = rada[rad]);

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

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

int main()
{
    int x, y, cod, i;
    ifstream f("disjoint.in");
    f>>n>>m;
    for (i=1; i<=n; i++)
    {
        rada[i] = 0;
        rang[i] = 1;
    }

    ofstream g("disjoint.out");

    for (i=1; i<=m; i++)
    {
        f>>cod>>x>>y;
        if (cod == 2)
        {
            if (find(x) == find(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
        else
        {
            Union(find(x), find(y));
        }
    }
    f.close();
    g.close();
    return 0;
}