#include <cstdio>
using namespace std;
const int maxn = 100005;
int root[maxn];

int find(int x)
{
    int rad,t;
    for(rad = x;root[rad]!=rad;rad = root[rad]);
    for(;root[x]!=x;)
    {
        t = root[x];
        root[x] = rad;
        x = t;
    }
    return rad;
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m;
    int tip,a,b;
    int i;
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;++i)
        root[i] = i;
    while(m--)
    {
        scanf("%d %d %d",&tip,&a,&b);
        if(tip == 1)
            root[find(a)] = root[find(b)];
        else
            if(find(a) == find(b))
                printf("DA\n");
        else
            printf("NU\n");
    }
    return 0;
}