#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1500;
struct Point {
  int x, y, id;
};
int n, sz[MAXN + 10], ans[MAXN + 10];
vector<int> G[MAXN + 10];
Point p[MAXN + 10];
void dfs(int u, int fa) {
  sz[u] = 1;
  for (unsigned int i = 0; i != G[u].size(); ++i) {
    int v = G[u][i];
    if (v == fa) continue;
    dfs(v, u);
    sz[u] += sz[v];
  }
}
int ox, oy;
bool cmp1(const Point& a, const Point& b) {
  return a.x != b.x ? a.x < b.x : a.y < b.y;
}
bool cmp2(const Point& a, const Point& b) {
  return (long long)(a.x - ox) * (b.y - oy) -
             (long long)(a.y - oy) * (b.x - ox) <
         0;
}
void doit(int u, int fa, int l, int r) {
  sort(p + l, p + r + 1, cmp1);
  ans[p[l].id] = u;
  ox = p[l].x;
  oy = p[l].y;
  sort(p + l + 1, p + r + 1, cmp2);
  int now = l;
  for (unsigned int i = 0; i != G[u].size(); ++i) {
    int v = G[u][i];
    if (v == fa) continue;
    doit(v, u, now + 1, now + sz[v]);
    now += sz[v];
  }
}
int main() {
  scanf("%d", &n);
  int u, v;
  for (int i = 1; i < n; ++i) {
    scanf("%d%d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &p[i].x, &p[i].y);
    p[i].id = i;
  }
  dfs(1, 0);
  doit(1, 0, 1, n);
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
  return 0;
}
