#include <cstdio>

int parent[100001], p = -1;

char outBuffer[300000];

int Find(int x)
{
    while(parent[x] != x)
    {
        x = parent[x];
    }

    return x;
}

void Union(int x, int y)
{
    parent[Find(y)] = Find(x);
}

int main()
{
    int sets, queries, task, x, y;

    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);

    scanf("%d %d", &sets, &queries);

    for(int i = 1; i <= sets; i++)
    {
        parent[i] = i;
    }

    for(int i = 1; i <= queries; i++)
    {
        scanf("%d %d %d", &task, &x, &y);

        if(task == 1)
        {
            Union(x, y);
        }
        else
        {
            if(Find(x) == Find(y))
            {
                outBuffer[++p] = 68;
                outBuffer[++p] = 65;
                outBuffer[++p] = 10;
            }
            else
            {
                outBuffer[++p] = 78;
                outBuffer[++p] = 85;
                outBuffer[++p] = 10;
            }
        }
    }

    puts(outBuffer);

    return 0;
}