// { Driver Code Starts
#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
struct node
{
	int data;
	struct node *left;
	struct node *right;
	struct node *next;
	
	node(int x){
	    data = x;
	    left = NULL;
	    right = NULL;
	    next = NULL;
	}
};
struct node* Inorder(struct node* root)
  {
      if(root->left==NULL)
         return root;
      Inorder(root->left);
  }
void populateNext(struct node* root);
void insert(struct node *root,int n1,int n2,char lr)
 {
 {
     if(root==NULL)
        return;
     if(root->data==n1)
     {
         switch(lr)
         {
          case 'L': root->left=new node(n2);
                    break;
          case 'R': root->right=new node(n2);
                    break;
         }
     }
     else
     {
         insert(root->left,n1,n2,lr);
         insert(root->right,n1,n2,lr);
     }
 }
 }
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
    int n;
    cin>>n;
    struct node *root=NULL;
    while(n--)
    {
        char lr;
        int n1,n2;
        cin>>n1>>n2;
        cin>>lr;
        if(root==NULL)
        {
            root=new node(n1);
            switch(lr){
                    case 'L': root->left=new node(n2);
                    break;
                    case 'R': root->right=new node(n2);
                    break;
                    }
        }
        else
        {
            insert(root,n1,n2,lr);
        }
       }
	populateNext(root);
	struct node *ptr = Inorder(root);
	while(ptr)
	{
		printf("%d->%d ", ptr->data, ptr->next? ptr->next->data: -1);
		ptr = ptr->next;
	}
cout<<endl;
     }
	return 0;
}
// } Driver Code Ends
/* Set next of p and all descendents of p by traversing them in reverse Inorder */
node *previous=NULL;
void InorderSucc(node *root){
    if(!root)
        return;
    InorderSucc(root->left);
    if(!previous){
        previous=root;
    }
    else{
        previous->next=root;
        previous=previous->next;
    }
    InorderSucc(root->right);
}
void populateNext(struct node* p)
{
    previous=NULL;
    InorderSucc(p);
}