#include <fstream>
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

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

int find(int x)
{
    int aux,q=x;

    while(q!=T[q]) q=T[q];

    for(;x!=T[x];)
    {
        aux = T[x];
        T[x] = q;
        x = aux;
    }

    return q;
}

void unite(int x,int y)
{
    if(R[x]<R[y]) T[x] = y;
    else T[y] = x;

    if(R[x] == R[y]) R[x]++;
}

int main()
{
    f>>n>>m;

    for(i=1;i<=n;i++)
        T[i]=i,R[i]=1;


    while(m--)
    {
        f>>a>>b>>c;
        if(a==2)
            if(find(b)==find(c)) g<<"DA"<<'\n';
            else g<<"NU"<<'\n';
        else
            unite(find(b),find(c));
    }
    return 0;
}