#include <bits/stdc++.h>
#define lung 100007

using namespace std;

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

int a[lung], n, m;

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

int Find(int x)
{
    int rad, y;
    rad=x;
    while (a[rad]!=0)
        rad=a[rad];
    while (x!=rad)
    {
        y=a[x];
        a[x]=rad;
        x=y;
    }
    return rad;
}

void Citire()
{
    int i, cod, x, y;
    fin >> n >> m;
    for (i=1; i<=m; i++)
    {
        fin >> cod >> x >> y;
        if (cod==1)
        {
            x=Find(x);
            y=Find(y);
            if (x!=y) Union(x, y);
        }
            else
            {
                x=Find(x);
                y=Find(y);
                if (x==y)
                    fout << "DA\n";
                else fout << "NU\n";
            }


    }
}


int main()
{
    Citire();
    return 0;
}