#include <fstream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#define pu(x) ((x^(x-1))&x)

using namespace std;

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

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

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

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

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