#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int h[100001],t[100001],n,m,cod,x,y;
void unif(int x,int y)
{
    if (h[x]<h[y]) t[x]=y;
    else t[y]=x;
    if (h[x]==h[y]) h[x]++;
}
int rad(int x)
{
    int r=x;
    while (t[r]!=r) r=t[r];
    while (x!=r)
    {
        int aux=t[x];
        t[x]=r;
        x=aux;
    }
    return r;
}
int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++)
    {
        h[i]=1;
        t[i]=i;
    }
    for (int i=1;i<=m;i++)
    {
        fin>>cod>>x>>y;
        int r1=rad(x);
        int r2=rad(y);
        if (cod==1)
        {
            unif(r1,r2);
        }
        if (cod==2)
        {
            if (r1==r2) fout<<"DA\n";
            else fout<<"NU\n";
        }
    }

    return 0;
}