#include <fstream>

using namespace std;

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

int n,m,tata[100001];

int find_(int nod)
{
    if(tata[nod]==0)
        return nod;
    tata[nod]=find_(tata[nod]);
    return tata[nod];
}

void union_(int x,int y)
{
    tata[find_(x)]=y;
}

void querry(int x,int y)
{
    if(find_(x)==find_(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
            querry(x,y);
    }
    return 0;
}