#include <fstream>
#include <algorithm>
#include <map>
#include <set>
#include <math.h>
#include <vector>
#include <unordered_map>
#include <bitset>
#include <deque>
#include <queue>


using namespace std;

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

struct DSU{
    int N;
    vector<int> parent,sizes;

    void init(int n) {
        N = n;
        parent.resize(n + 1);
        sizes.resize(n + 1);
        for(int i = 1;i<=N;i++){
            parent[i] = i;
            sizes[i] = 1;
        }
    }
    int find(int u) {
        if(parent[u] == u) return u;
        return parent[u] = find(parent[u]);
    }
    void unit(int v,int u) {
        int p1 = find(v);
        int p2 = find(u);
        if(p1 == p2) return;
        if(sizes[p1] < sizes[p2]) {
            parent[p1] = parent[p2];
            sizes[p2]+=sizes[p1];
            sizes[p1] = 0;
        }
        else {
            parent[p2] = parent[p1];
            sizes[p1] += sizes[p2];
            sizes[p2] = 0;
        }
    }
};

signed main() {
    DSU dsu;
    int n,m;
    fin >> n >> m;
    dsu.init(n);
    for(int i = 0;i < m;i++){
        int op,x,y;
        fin >> op >> x >> y;
        if(op == 1) dsu.unit(x,y);
        else {
            int p1 = dsu.find(x);
            int p2 = dsu.find(y);
            fout << (p1 == p2 ? "DA" : "NU") << '\n';
        }
    }
}