#include <iostream>
#pragma GCC optimize("O3,unroll-loops")
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iomanip>
#include <numeric>
#include <cstdio>
#include <bitset>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#define int long long
//#define int short
using namespace std;

const int nmax = 1e5;

int n, m, parent[nmax + 5];

void makeset(int i){
    parent[i] = i;
}

int findset(int i){
    if (i == parent[i]){
        return i;
    }
    return parent[i] = findset(parent[i]);
}

void combinesets(int i, int j){
    i = findset(i);
    j = findset(j);
    parent[j] = i;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    cin>>n>>m;
    for (int i = 1; i <= n; i++){
        makeset(i);
    }
    while (m--){
        int op, i, j;
        cin>>op>>i>>j;
        if (op == 1){
            combinesets(i, j);
        }
        else{
            if (findset(i) == findset(j)){
                cout<<"DA\n";
            }
            else{
                cout<<"NU\n";
            }
        }
    }
}