#include <bits/stdc++.h>
using namespace std;
struct Point {
  int x, y, id;
  Point() {}
  Point(int _x, int _y) { x = _x, y = _y; }
};
vector<int> G[2000];
Point vp[2000];
int n;
int ans[2000], sz[2000];
bool vis[2000];
int li;
void dfs(int u, int parent) {
  sz[u] = 1;
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i];
    if (v == parent) continue;
    dfs(v, u);
    sz[u] += sz[v];
  }
}
long long cross(Point p1, Point p2) {
  return (long long)p1.x * p2.y - (long long)p2.x * p1.y;
}
bool cmp(const Point &a, const Point &b) {
  return cross(Point(a.x - vp[li].x, a.y - vp[li].y),
               Point(b.x - vp[li].x, b.y - vp[li].y)) < 0;
}
void dfs(int id, int l, int r) {
  int v = INT_MAX, pos;
  for (int i = l; i <= r; i++) {
    if (vp[i].x < v) v = vp[i].x, pos = i;
  }
  swap(vp[l], vp[pos]);
  li = l;
  ans[vp[li].id] = id, vis[id] = 1;
  if (l == r) return;
  sort(vp + l + 1, vp + r + 1, cmp);
  pos = l;
  for (int i = 0; i < G[id].size(); i++) {
    int v = G[id][i];
    if (vis[v]) continue;
    dfs(v, pos + 1, pos + sz[v]);
    pos += sz[v];
  }
}
int main() {
  cin >> n;
  for (int i = 0, u, v; i < n - 1; i++) {
    cin >> u >> v;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) {
    cin >> vp[i].x >> vp[i].y;
    vp[i].id = i;
  }
  dfs(1, 0);
  dfs(1, 1, n);
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  return 0;
}
