#include <fstream>
#include <cstring>
#define NMax 100001
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, m, tree_set[NMax], i, query, x, y, child1, child2;
int main()
{
    f>>n>>m;
    memset(tree_set, -1, sizeof(tree_set));
    for (i=1; i<=m; i++) {
        f>>query>>x>>y;
        if (query==1) {
            child1=x;
            while (tree_set[child1] > 0)
                child1=tree_set[child1];
            child2=y;
            while (tree_set[child2] > 0)
                child2=tree_set[child2];
            tree_set[child1]=child2;
        }
        else {
            child1=x;
            while (tree_set[child1] > 0)
                child1=tree_set[child1];
            child2=y;
            while (tree_set[child2] > 0)
                child2=tree_set[child2];
            if (child1 == child2)
                g<<"DA"<<"\n";
            else
                g<<"NU"<<"\n";
        }
    }
    return 0;
}