#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 1e5;
int tati[NMAX + 2], d[NMAX + 2];
int n, m, q, a, b;
int find(int x) {
    if(tati[x] == x)
        return x;
    else
        return find(tati[x]);
}
void alipire(int x, int y) {
    if(d[x] == d[y]) {
        d[x]++;
        tati[y] = x;
    } else if(d[x] < d[y]) {
        tati[x] = y;
    } else {
        tati[y] = x;
    }
}
int main() {
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        tati[i] = i;
        d[i] = 1;
    }
    for(int i = 1; i <= m; i++) {
        cin >> q >> a >> b;
        a = find(a);
        b = find(b);
        if(q == 1)
            alipire(a, b);
        else {
            if(a == b)
                cout << "DA\n";
            else
                cout << "NU\n";
        }
    }
    return 0;
}