#include <iostream>
#include <fstream>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <vector>
#include <limits.h>
#include <map>
using namespace std;

const int LIM = 1005;
int n, m;
bool mt[LIM][LIM];

int main() {
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    fin >> n >> m;

    for(int i = 1; i <= n; ++i)
        mt[i][i] = true;

    for(int i = 1; i <= m; ++i){
        int cod, a, b;
        fin >> cod >> a >> b;

        if(cod == 1){
            for(int i = 1; i < LIM; ++i){
                if(mt[a][i] == true)
                    mt[b][i] = true;
                if(mt[b][i] == true)
                    mt[a][i] = true;
            }
        }
        else{
            if(mt[a][b] == true)
                fout << "DA" << "\n";
            else
                fout << "NU" << "\n";
        }

    }


    return 0;
}