#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int x,y,z,n,m,sef[100005],rang[100005];
int find(int sef[],int i)
{
    if (sef[i]!=i) sef[i]=find(sef,sef[i]);
    return sef[i];
}
void unite(int sef[],int x,int y)
{
    int xset=find(sef,x);
    int yset=find(sef,y);
    if (rang[xset]>rang[yset])
        sef[yset]=xset;
        else sef[xset]=yset;
    if (rang[xset]==rang[yset]) rang[yset]++;
}
int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++)
    {
        sef[i]=i;
        rang[i]=1;
    }
    for (int i=1;i<=m;i++)
    {
        fin>>x>>y>>z;
        if (x==2)
        {
            if (find(sef,y)==find(sef,z))
                fout<<"DA"<<'\n';
            else fout<<"NU"<<'\n';
        }
        else{
            unite(sef,y,z);
        }
    }
    return 0;
}