#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[1005], nr[1005], n, m, i, x, y, o;
void initializare() {
    for (i=1; i<=n; i++) {
        t[i]=i;
        nr[i]=1;
    }
}
int radacina(int x) {
    if (x!=t[x]) {
        t[x]=radacina(t[x]);
    }
    return t[x];
}
void uneste(int x, int y) {
    x=radacina(x);
    y=radacina(y);
    if (x!=y) {
        if (nr[x]<nr[y]) {
            t[x]=y;
            nr[y]+=nr[x];
        }
        else {
            t[y]=x;
            nr[x]+=nr[y];
        }
    }
}
int main()
{
    fin>>n>>m;
    initializare();
    while (m--) {
        fin>>o>>x>>y;
        if (o==1) {
            uneste(x, y);
        }
        else {
            if (radacina(x)==radacina(y)) {
                fout<<"DA\n";
            }
            else {
                fout<<"NU\n";
            }
        }
    }
    return 0;
}