#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n,m, type, v1, v2,t[100005],inaltimi[100005];

void recursiv(int a, int b)
{
    if (inaltimi[b]==1)
    {
        t[b]=t[a];
        inaltimi[b]+=inaltimi[a];
        return;
    }
    recursiv(a,t[b]);

}

int main() {

    f >> n >> m;
    for (int i=1; i<=n; i++)
        t[i]=i,inaltimi[i]=1;
    for (int i=1; i<=m; i++)
    {
        f >> type >> v1 >> v2;
        if (type==1)
        {
            recursiv(v1,v2);
        }
        else
        {
            while(inaltimi[v1]!=1)
            {
                v1=t[v1];
            }
            while (inaltimi[v2]!=1)
                v2=t[v2];
            if (v1==v2)
                g << "DA";
            else
                g <<"NU";
            g << '\n';
        }
    }
    return 0;
}