#include <bits/stdc++.h>

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 findx(int u){
        if(parent[u] == u)
            return u;
        return parent[u] = findx(parent[u]);
    }
    void unit(int u,int v) {
        u = findx(u);
        v = findx(v);
        if(u == v)
            return;
        if(sizes[v] > sizes[u])
            swap(u,v);
        parent[v] = u;
        sizes[u] += sizes[v];
    }
};


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