#include <fstream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <stack>
#include <iomanip>

using namespace std;

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

int p[100010],n,m,i;

int Find(int x)
{
    int rad=x;
    while (p[rad]!=rad)
        rad=p[rad];
    while (p[x]!=x)
    {
        int aux=x;
        x=p[x];
        p[aux]=rad;
    }
    return rad;
}

void Union(int x, int y)
{
    p[x]=y;
}

int main()
{
    fin >> n >> m;
    for (i=1; i<=n; i++)
        p[i]=i;
    for (i=1; i<=m; i++)
    {
        int op,a,b;
        fin >> op >> a >> b;
        if (op==1)
        {
            a=Find(a);
            b=Find(b);
            Union(a,b);
        }
        else
        {
            if (Find(a)==Find(b))
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }
}