using System;

using System.Collections.Generic;

public class Program

{

    public static void Main()

    {

        int n = int.Parse(Console.ReadLine());

        // row index - number of the city from which the edge goes (city numbers start with 1 so n rows, not n - 1)

        // column[0] - city to which the road goes with minimum number (left child)

        // column[1] - city to which the road goes with maximum number (right child)

        // column[2] - parent city to the current city

        // column[3] - number of traversals via edge (counter)

        int[,] edges = new int[n + 1, 4];

        for(int i = 0; i < n - 1; i++)

        {

            string[] input = Console.ReadLine().Split(' ');

            int cityFrom = int.Parse(input[0]);

            int cityTo = int.Parse(input[1]);

            if(edges[cityFrom, 0] == 0)

            {

                edges[cityFrom, 0] = cityTo;

            }

            else

            {

                if(cityTo < edges[cityFrom, 0])

                {

                    int temp = edges[cityFrom, 0];

                    edges[cityFrom, 0] = cityTo;

                    edges[cityFrom, 1] = temp;

                }

                else

                {

                    edges[cityFrom, 1] = cityTo;

                }

            }

            edges[cityTo, 2] = cityFrom;

        }

        string[] str = Console.ReadLine().Split(' ');

        int k = str.Length;

        int[] leaves = new int[k];

        int[][] leafFullRoutes = new int[k][];

        for(int i = 0; i < k; i++)

        {

            int leaf = int.Parse(str[i]);

            leaves[i] = leaf;

            int current = leaf;

            var leafFullRoute = new List<int>();

            while(true)

            {

                leafFullRoute.Add(current);

                int parent = edges[current, 2];

                if(parent == 0)

                {

                    break;

                }

                current = parent;

            }

            leafFullRoutes[i] = leafFullRoute.ToArray();

        }

        var route = new List<int>();

        int length = 0;

        // Move from root to the first leaf

        int[] firstRoute = leafFullRoutes[0];

        length = firstRoute.Length;

        for(int j = length - 1; j > 0; j--)

        {

            int current = firstRoute[j];

            route.Add(current);

        }

        for(int i = 0; i < k - 1; i++)

        {

            length = leafFullRoutes[i].Length;

            int nextHead = 1;

            int nextHeadIndex = leafFullRoutes[i + 1].Length - 1;

            int current = 0;

            int index = 0;

            // Move up from leaf to root or to the intersection with the next leaf branch - nextHead

            for(int j = 0; j < length - 1; j++)

            {

                current = leafFullRoutes[i][j];

                route.Add(current);

                index = Array.IndexOf(leafFullRoutes[i + 1], current);

                if(index != -1)

                {

                    nextHead = current;

                    nextHeadIndex = index;

                    break;

                }

            }

            // Move down from nextHead to next leaf

            int nextLeaf = leafFullRoutes[i + 1][0];

            while(current != nextLeaf)

            {

                //index--;

                current = leafFullRoutes[i + 1][index];

                route.Add(current);

            }

        }

        // Move from final leaf to the root

        int[] lastRoute = leafFullRoutes[leafFullRoutes.Length - 1];

        length = lastRoute.Length;

        for(int j = 0; j < length; j++)

        {

            int current = lastRoute[j];

            route.Add(current);

        }

        foreach(var vertex in route)

        {

            Console.Write(vertex + " ");

        }

    }

}