#include <fstream>
#include "string.h"

using namespace std;

#define NMAX 100020

int n, m;
int parent[NMAX];
int rank[NMAX];

inline int rep(int x)
{
    int i, rep, p;

    i = x;
    while (parent[i] != -1)
        i = parent[i];
    rep = i;

//    /* flattening optimization */
//    i = x;
//    while (parent[i] != -1) {
//        p = parent[i];
//        parent[i] = rep;
//        i = p;
//    }
    return rep;
}

inline void unite(int x, int y)
{
    int repx, repy;
    repx = rep(x);
    repy = rep(y);

    if (rank[repx] > rank[repy]) {
        parent[repy] = repx;
    } else if (rank[repx] < rank[repy]) {
        parent[repx] = repy;
    } else {
        parent[repx] = repy;
        rank[repy]++;
    }
}



int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    scanf("%d %d ", &n, &m);

    memset(parent, -1, n*sizeof(int));
    memset(rank, 0, n*sizeof(int));

    int op, x, y;
    while (m-->0) {
        scanf("%d %d %d", &op, &x, &y);
        x--; y--;
        switch (op) {
            case 1:
                unite(x, y);
                break;
            case 2:
                if (rep(x) == rep(y))
                    printf("DA\n");
                else
                    printf("NU\n");
                break;
        }
    }
    return 0;
}