#include <bits/stdc++.h>

using namespace std;

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

int p[100005],n,m,i,a,b,c;

int find(int a)
{
    if (p[a]==a) return a;
    int q=find(p[a]);
    p[a]=q;
    return q;
}

void uneste(int a, int b)
{
    a=find(a);
    b=find(b);
    p[a]=b;
}

int main() 
{
    fin>>n>>m;
    for (i=1; i<=n; i++)
        p[i]=i;
    for (i=1; i<=m; i++)
    {
        fin>>c>>a>>b;
        if (c==1)
            uneste(a,b); else {
        if (find(a)==find(b)) fout<<"DA\n"; else fout<<"NU\n"; }
    }
}