#include <fstream>

using namespace std;

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

int n,m,tata[100001];

void union_(int x,int y)
{
    while(tata[x]!=0)
        x=tata[x];
    tata[x]=y;
}

void find_(int x,int y)
{
    while(tata[x]!=0)
        x=tata[x];
    while(tata[y]!=0)
        y=tata[y];
    if(x==y)
        g<<"DA"<<'\n';
    else
        g<<"NU"<<'\n';
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int cod,x,y;
        f>>cod>>x>>y;
        if(cod==1)
            union_(x,y);
        else
            find_(x,y);
    }
    return 0;
}