#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
vector<int> component[100001];
int n, m, whichComponent[100001];

int main() {
    fin.tie(0);
    fout.tie(0);
    ios::sync_with_stdio(0);
    fin >> n >> m;
    int operation, a, b;
    for (int i = 1; i <= n; i++) {
        whichComponent[i] = i;
        component[i].push_back(i);
    }
    for (int i = 0; i < m; i++) {
        fin >> operation >> a >> b;
        if (operation == 1) {
            /*int maxNode = a, minNode = b;
            if (whichComponent[a] < whichComponent[b])
                swap(minNode, maxNode);
            for (int it : component[whichComponent[maxNode]]) {
                whichComponent[it] = whichComponent[minNode];
                component[whichComponent[minNode]].push_back(it);
            }*/
            for (int it : component[whichComponent[a]]) {
                whichComponent[it] = whichComponent[b];
                component[whichComponent[b]].push_back(it);
            }
        }
        else {
            if (whichComponent[a] == whichComponent[b])
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }

    for (int i = 1; i <= n; i++)
        cout << i << " -> " << whichComponent[i] << "\n";
    cout << "\n";
    for (int i = 1; i <= n; i++) {
        cout << i << " -> ";
        for (int it : component[i])
            cout << it << " ";
        cout << "\n";
    }
    return 0;
}