#include <bits/stdc++.h>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int t[100001], n, m;
int root(int x)
{
    int rx=x;
    while (t[rx]){
        rx=t[rx];
    }
    while (t[x]){
        int tmp=t[x];
        t[x]=rx;
        x=tmp;
    }
    return rx;
}
void join(int x, int y)
{
    int rx=root(x), ry=root(y);
    t[ry]=rx;
}
bool joined(int x, int y)
{
    x=root(x);
    y=root(y);
    return x==y;
}
int main()
{
    fin>>n>>m;
    for (int i=0; i<m; ++i){
        int c, x, y;
        fin>>c>>x>>y;
        if (c==1){
            if (!joined(x, y)){
                join(x, y);
            }
        } else {
            if (joined(x, y))fout<<"DA\n";
            else fout<<"NU\n";
        }
    }
    return 0;
}