#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
struct Point {
  long long x, y, id;
} p[maxn], tmp;
vector<int> g[maxn];
long long siz[maxn], ans[maxn];
long long n;
inline void add(int u, int v) {
  g[u].push_back(v);
  g[v].push_back(u);
}
inline bool cmp(Point a, Point b) {
  long long ax = a.x - tmp.x, ay = a.y - tmp.y;
  long long bx = b.x - tmp.x, by = b.y - tmp.y;
  if (ax >= 0 && bx <= 0) return 1;
  if (ax <= 0 && bx >= 0) return 0;
  return ax * by > ay * bx;
}
void dfs(int x, int fa) {
  siz[x] = 1;
  for (int &y : g[x]) {
    if (y == fa) continue;
    dfs(y, x);
    siz[x] += siz[y];
  }
}
void sol(long long l, long long r, long long x, long long fa) {
  long long cur = l;
  for (int i = l + 1; i <= r; i++)
    if (p[i].x < p[cur].x || (p[i].x == p[cur].x && p[i].y < p[cur].y)) cur = i;
  swap(p[l], p[cur]);
  tmp = p[l];
  ans[p[l].id] = x;
  sort(p + l + 1, p + r + 1, cmp);
  long long now = l + 1;
  for (int &y : g[x]) {
    if (y == fa) continue;
    sol(now, now + siz[y] - 1, y, x);
    now += siz[y];
  }
}
int main() {
  cin >> n;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    add(u, v);
  }
  long long x, y, w;
  for (int i = 1; i <= n; i++) {
    cin >> x >> y;
    p[i] = (Point){x, y, i};
  }
  dfs(1, 0);
  sol(1, n, 1, 0);
  for (int i = 1; i <= n; i++) printf("%lld%c", ans[i], "\n"[i == n]);
}
