#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;

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

int n,m;
int t[NMAX];

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

int Find(int x)
{
    int y=x, aux;
    while(t[y])
        y = t[y];
    while(t[x])
    {
        aux = t[x];
        t[x] = y;
        x = aux;
    }
    return y;
}

int main()
{
    fin>>n>>m;
    while(m--)
    {
        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";
        }
    }
    return 0;
}