#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "disjoint";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 100000 + 5;

int N, M;
int root[NMAX];

int find(int x) {
    if(x != root[x]) root[x] = find(root[x]);
    return root[x];
}

void unite(int x, int y) {
    root[x] = y;
}

int main() {
    int i, t, x, y;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    for(i = 1; i <= N; i++)
        root[i] = i;

    while(M--) {
        scanf("%d%d%d", &t, &x, &y);

        if(t == 1)
            unite(find(x), find(y));
        else
            printf("%s\n", (find(x) == find(y)) ? "DA" : "NU");
    }

    return 0;
}