#include<fstream>
#include<vector>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int l[100001];
int n,m,i,j,k,ok,x,y,q;
void read()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        l[i]=-1;
    }
}
void reunion(int x, int y)
{
    if(l[x]>l[y])
    {
        l[y]+=l[x];
        l[x]=y;
    }
    else
    {
        l[x]+=l[y];
        l[y]=x;
    }
}
void caut(int x, int y)
{
    while(l[x]>0)
    x=l[x];
    while(l[y]>0)
    y=l[y];
    if(x==y)
    g<<"DA\n";
    else
    g<<"NU\n";
}
void solve()
{
    for(k=1;k<=m;k++)
    {
        f>>q>>x>>y;
        if(q==1)
        reunion(x,y);
        else
        if(q==2)
        caut(x,y);
    }
}
int main()
{
    read();
    solve();
}