#include <bits/stdc++.h>

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

int n, m, t, x, y, f[100005], h[100005], nxt[100005];

void init(int n)
{
    for(int i=1; i<=n; i++)
        f[i]=i, h[i]=0, nxt[i]=i;
}

int Find(int x)
{
    return f[x];
}

void Union(int x, int y)
{
    int rx=Find(x);
    int ry=Find(y);
    if(rx!=ry)
    {
        h[x]+=h[y];
        int i=y;
        do {
            f[i]=rx;
            i=nxt[i];
        } while(i!=y);
        int nx=nxt[x];
        nxt[x]=nxt[y];
        nxt[y]=nx;
    }
}

int main()
{
    fin >> n >> m;
    init(n);
    while(m--)
    {
        fin >> t >> x >> y;
        if(t==1)
            Union(x, y);
        else if(Find(x)==Find(y))
            fout << "DA\n";
        else
            fout << "NU\n";
    }
    return 0;
}