#include <iostream>
using namespace std;
struct Node
{
    int val, nxt, pre;
} node[100005];
int n, m, head, x, now;
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int id, val, nxt;
        cin >> id >> val >> nxt;
        node[id].val = val;
        node[id].nxt = nxt;
        node[node[id].nxt].pre = id;
    }
    head = 1;
    cin >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> x;
        if (x == head)
            head = node[head].nxt;
        else if (node[x].nxt == -1)
            node[node[x].pre].nxt = -1;
        else
        {
            node[node[x].pre].nxt = node[x].nxt;
            node[node[x].nxt].pre = node[x].pre;
        }
    }
    now = head;
    while (now != -1)
    {
        cout << node[now].val << " ";
        now = node[now].nxt;
    }
    return 0;
}