#include <fstream>
#include <map>
#include <vector>

using namespace std;

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

const int NMAX = 100005;

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

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

int main()
{
    int n,m,q,x,y;
    DSU dsu;
    fin>>n>>m;
    dsu.init(n);
    for(int i = 1;i <= m;i++){
        fin>>q>>x>>y;
        if(q == 1){
            dsu.unite(x,y);
        }
        else
        {
            if(dsu.find(x) == dsu.find(y))
                fout<<"DA"<<"\n";
            else
                fout<<"NU"<<"\n";
        }
    }
    return 0;
}