#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>

typedef struct LinkedList{
    int data;
    struct LinkedList *left;
    struct LinkedList *right;
}LinkedList;

void insert_node(LinkedList **node,int data)
{   
    LinkedList *pNode,*temp,*n;
    temp = *node;
    pNode=NULL;
    while(temp!=NULL){
        if(temp->data == data)
            return;

        pNode=temp;
        if(temp->data > data)
            temp = temp->left;
        else if(temp->data < data)
            temp = temp->right;
    }
    n = (LinkedList *)malloc(sizeof(LinkedList));

    n->data = data;
    n->left = n->right=NULL;
    if(pNode!=NULL)
        if(pNode->data >data)
            pNode->left =n;
        else
            pNode->right = n;
    else
        *node=n;
}
void postorder(LinkedList *node){
    if(node!=NULL) {

        postorder(node->left);      
        postorder(node->right);
        printf("%d ",node->data);
    }
}
int main()
{   
    int test,count,i,data;
    LinkedList *root=NULL; 

    scanf("%d",&test);

    while(test--){
        scanf("%d",&count);
        for(i=0;i<count;i++)
        {
            scanf("%d",&data);
            insert_node(&root,data);
        }
        for(i=0;i<count;i++)
            scanf("%d",&data);      

        postorder(root);
        printf("\n");
        root= NULL;     
    }
    return 0;
}