#include <bits/stdc++.h>
using namespace std;
struct PT {
  int x, y, id;
  PT(int _x, int _y, int _id) : x(_x), y(_y), id(_id) {}
};
int n;
PT *P[1505];
int ord[1505];
int id[1505];
int l[1505];
int r[1505];
int ans[1505];
int ct = 0;
PT *cP;
bool cmp(PT *a, PT *b) {
  return (long long)(a->x - cP->x) * (b->y - cP->y) -
             (long long)(a->y - cP->y) * (b->x - cP->x) >
         0;
}
bool cmp2(PT *a, PT *b) { return a->x != b->x ? a->x < b->x : a->y < b->y; }
vector<int> G[1505];
int sz[1505];
void dfs(int u, int p) {
  l[u] = ct++;
  sz[u] = 1;
  id[l[u]] = u;
  for (auto v : G[u]) {
    if (v == p) continue;
    dfs(v, u);
    sz[u] += sz[v];
  }
  r[u] = ct - 1;
}
void solve(int u, int L, int R, int p) {
  sort(P + L, P + R + 1, cmp2);
  for (int i = 0; i < n; i++) {
  }
  ans[P[L]->id] = u;
  cP = P[L];
  sort(P + L + 1, P + R + 1, cmp);
  int cur = L + 1;
  for (auto v : G[u]) {
    if (v == p) continue;
    solve(v, cur, cur + sz[v] - 1, u);
    cur += sz[v];
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  for (int i = 0, x, y; i < n; i++) {
    scanf("%d%d", &x, &y);
    P[i] = new PT(x, y, i);
  }
  dfs(1, -1);
  for (int i = 0; i < n; i++) {
  }
  solve(1, 0, n - 1, -1);
  for (int i = 0; i < n; i++) {
    printf("%d ", ans[i]);
  }
}
