#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,op,x,y,T[100001];
int rad(int x)
{
    int r,y;
    r=x;
    while(T[r]!=0)r=T[r];
    while(T[x]!=0)
    {
        y=T[x];T[x]=r;x=y;
    }
    return r;
}
void reuneste(int x, int y)
{
    T[x]=y;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        if(op==2)
        {
            if(rad(x)!=rad(y))fout<<"NU"<<'\n';
            else fout<<"DA"<<'\n';
        }
        else reuneste(rad(x),rad(y));
    }
    return 0;
}