#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

void query(int, int);
void join(int, int);
int find(int);

int n, m, p[100005];

int main()
{
    int i, a, b, tip;
    fin>>n>>m;
    for(i=1; i<=n; i++) p[i]=i;
    for(i=1; i<=m; i++)
    {
        fin>>tip>>a>>b;
        if(tip==1) join(a, b);
        else query(a, b);
    }
    return 0;
}

int find(int nod)
{
    if(p[nod]==nod) return nod;
    p[nod]=p[find(p[nod])];
    return p[nod];
}

void join(int a, int b)
{
    int pa, pb;
    pa=find(a);
    pb=find(b);
    if(pa!=pb) p[pa]=pb;
}

void query(int a, int b)
{
    int pa, pb;
    pa=find(a);
    pb=find(b);
    if(pa!=pb) fout<<"NU"<<'\n'; 
    else fout<<"DA"<<'\n';
}