#include <bits/stdc++.h>
const double eps = 1e-9;
const int oo = 1000000000;
const double E = 2.7182818284590452353602874713527;
const double pi = 3.1415926535897932384626433832795;
using namespace std;
struct case1 {
  int x, y, num;
} p[1505];
int e[1505][1505], s[1505], ans[1505];
int tmp;
void dfs(int now, int last) {
  s[now] = 1;
  for (int i = 1; i <= e[now][0]; i++)
    if (e[now][i] != last) {
      dfs(e[now][i], now);
      s[now] += s[e[now][i]];
    }
}
bool cmp(case1 a, case1 b) {
  return (1LL * (a.x - p[tmp].x) * (b.y - p[tmp].y) -
          1LL * (b.x - p[tmp].x) * (a.y - p[tmp].y)) > 0;
}
void build(int l, int r, int x, int last) {
  tmp = l;
  for (int i = l + 1; i <= r; i++)
    if (p[i].y > p[tmp].y) tmp = i;
  ans[p[tmp].num] = x;
  swap(p[tmp], p[l]);
  tmp = l;
  sort(p + l + 1, p + r + 1, cmp);
  int si = l;
  for (int i = 1; i <= e[x][0]; i++)
    if (e[x][i] != last) {
      build(si + 1, si + s[e[x][i]], e[x][i], x);
      si += s[e[x][i]];
    }
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    e[a][++e[a][0]] = b;
    e[b][++e[b][0]] = a;
  }
  dfs(1, 0);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
    p[i].num = i;
  }
  build(1, n, 1, 0);
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  return 0;
}
