#include <iostream>
#include <fstream>

using namespace std;

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

const int MAX=1e5+5;
int n,m,tip,a,b,t[MAX],rang[MAX];

int root(int x)
{
    while(x!=t[x])
        x=t[x];
    return x;
}

void uneste(int x,int y)
{
    if(rang[x]<rang[y])
        t[x]=t[y];
    else
    {
        t[y]=t[x];
        if(rang[x]==rang[y])
            rang[x]++;
    }
}

int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;i++)
        t[i]=i;
    while(m--)
    {
        fin >> tip >> a >> b;
        if(tip==1)
            uneste(root(a),root(b));
        else
            fout << (root(a)==root(b)?"DA\n":"NU\n");
    }
	return 0;
}