#include <bits/stdc++.h>
using namespace std;
const int maxn = 1500;
int n;
vector<int> adj[maxn];
vector<int> ch[maxn];
bool mark[maxn];
int sub[maxn];
int ans[maxn];
void dfs(int x) {
  mark[x] = 1;
  sub[x] = 1;
  for (__typeof(adj[x].begin()) it = adj[x].begin(); it != adj[x].end(); it++) {
    int y = *it;
    if (!mark[y]) {
      ch[x].push_back(y);
      dfs(y);
      sub[x] += sub[y];
    }
  }
}
pair<pair<int, int>, int> pv;
bool cmp(const pair<pair<int, int>, int>& A,
         const pair<pair<int, int>, int>& B) {
  return (A.first.first - pv.first.first) *
             (long long)(B.first.second - pv.first.second) >
         (A.first.second - pv.first.second) *
             (long long)(B.first.first - pv.first.first);
}
void go(int v, vector<pair<pair<int, int>, int> > p) {
  sort(p.begin(), p.end());
  ans[p[0].second] = v + 1;
  pv = p[0];
  reverse(p.begin(), p.end());
  p.resize(p.size() - 1);
  sort(p.begin(), p.end(), cmp);
  vector<pair<pair<int, int>, int> > t;
  int pos = 0;
  for (int i = 0, _n = (int)((int((ch[v]).size()))); i < _n; i++) {
    int u = ch[v][i];
    for (int j = 0, _n = (int)(sub[u]); j < _n; j++) t.push_back(p[pos++]);
    go(u, t);
    t.clear();
  }
}
int main() {
  cin >> n;
  for (int i = 0, _n = (int)(n - 1); i < _n; i++) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  dfs(0);
  vector<pair<pair<int, int>, int> > p(n);
  for (int i = 0, _n = (int)(n); i < _n; i++)
    cin >> p[i].first.first >> p[i].first.second, p[i].second = i;
  go(0, p);
  for (int i = 0, _n = (int)(n); i < _n; i++) cout << ans[i] << ' ';
  cout << endl;
}
