#include <cstdio>
#define MAXN 100000
using namespace std;
int t[MAXN+1], n;
int query(int x)
{
    if(t[x]==x)
        return x;
    return t[x]=query(t[x]);
}
inline void join(int x, int y)
{
    int rx=query(x), ry=query(y);
    t[rx]=ry;
}
int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    int i, m,x, y, cer;
    scanf("%d%d", &n, &m);
    for(i=1;i<=n;i++)
        t[i]=i;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d", &cer, &x, &y);
        if(cer==1)
            join(x, y);
        else{ if(query(x)==query(y))
                printf("DA\n");
        else printf("NU\n");
        }
    }
    return 0;
}