#include <bits/stdc++.h>
using namespace std;
int n, s[1510];
vector<pair<int, pair<int, int> > > x;
vector<int> e[1510];
int c[1510], par[1510];
int curnode;
double cval[1510];
bool cmp(pair<int, pair<int, int> > a, pair<int, pair<int, int> > b) {
  return cval[a.first] < cval[b.first];
}
bool cY(pair<int, pair<int, int> > a, pair<int, pair<int, int> > b) {
  return a.second.second < b.second.second;
}
void dp(int treenode, vector<pair<int, pair<int, int> > > &nodes) {
  int cmin = 0;
  for (int i = 0; i < nodes.size(); i++) {
    if (nodes[i].second.second < nodes[cmin].second.second) cmin = i;
  }
  swap(nodes[cmin], nodes[0]);
  curnode = nodes[0].first;
  c[curnode] = treenode;
  double pivotX = nodes[0].second.first;
  double pivotY = nodes[0].second.second;
  nodes.erase(nodes.begin());
  for (int i = 0; i < nodes.size(); i++) {
    pair<int, pair<int, int> > j = nodes[i];
    cval[j.first] = atan2(j.second.second - pivotY, j.second.first - pivotX);
  }
  sort(nodes.begin(), nodes.end(), cmp);
  for (int i = 0; i < e[treenode].size(); i++) {
    int j = e[treenode][i];
    if (j != par[treenode]) {
      vector<pair<int, pair<int, int> > > nxt;
      for (int k = 0; k < s[j]; k++) {
        nxt.push_back(nodes.back());
        nodes.pop_back();
      }
      dp(j, nxt);
    }
  }
}
int dfs(int i, int p) {
  par[i] = p;
  s[i] = 1;
  for (auto &j : e[i]) {
    if (j != p) s[i] += dfs(j, i);
  }
  return s[i];
}
int32_t main() {
  cin >> n;
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    e[a].push_back(b);
    e[b].push_back(a);
  }
  x.resize(n);
  for (int i = 0; i < n; i++) {
    x[i].first = i;
    cin >> x[i].second.first >> x[i].second.second;
  }
  sort(x.begin(), x.end(), cY);
  dfs(0, 0);
  dp(0, x);
  for (int i = 0; i < n; i++) cout << c[i] + 1 << " ";
  return 0;
}
