#include <fstream>
#include <vector>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("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++){
            sizes[i]=1;
            parent[i]=i;
        }
    }
    int find(int u){
        while(u!=parent[u]){
            u=parent[parent[u]];
        }
        return u;
    }
    void unite(int u, int v){
        v=find(v);
        u=find(u);
        if(u==v) return;
        if(sizes[u]<sizes[v]) swap(u, v);
        parent[v]=u;
        sizes[u]+=sizes[v];
    }
};
int main()
{
    int n, m;
    cin>>n>>m;
    DSU dsu;
    dsu.init(n);
    for(int i=0; i<m; i++){
        int t, x, y;
        cin>>t>>x>>y;
        if(t==1){
            dsu.unite(x, y);
        }
        else {
            int X=dsu.find(x), Y=dsu.find(y);
            if(X==Y){
                cout<<"DA\n";
            }
            else cout<<"NU\n";
        }
    }
}