#include <bits/stdc++.h>
using namespace std;
vector<int> E[1505];
long long pos_x, pos_y;
struct node {
  int x, y, id;
  bool operator<(const node &s) const { return y < s.y; }
} A[1505];
bool cmp(node a, node b) {
  return (a.x - pos_x) * (b.y - pos_y) > (a.y - pos_y) * (b.x - pos_x);
}
int Ans[1505];
int Fa[1505], sz[1505];
void dfs(int x, int fr) {
  Fa[x] = fr;
  sz[x] = 1;
  for (int i = (0), _t = (E[x].size() - 1); i <= _t; ++i) {
    int y = E[x][i];
    if (y == fr) continue;
    dfs(y, x);
    sz[x] += sz[y];
  }
}
void solve(int L, int R, int x) {
  int s = L;
  for (int i = (L + 1), _t = (R); i <= _t; ++i)
    if (A[s].x > A[i].x) s = i;
  node tmp = A[L];
  A[L] = A[s];
  A[s] = tmp;
  Ans[A[L].id] = x;
  pos_x = A[L].x;
  pos_y = A[L].y;
  L++;
  if (L > R) return;
  sort(A + L, A + R + 1, cmp);
  for (int i = (0), _t = (E[x].size() - 1); i <= _t; ++i) {
    int y = E[x][i];
    if (y == Fa[x]) continue;
    solve(L, L + sz[y] - 1, y);
    L += sz[y];
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = (2), _t = (n); i <= _t; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    E[x].push_back(y);
    E[y].push_back(x);
  }
  for (int i = (1), _t = (n); i <= _t; ++i) {
    scanf("%d%d", &A[i].x, &A[i].y);
    A[i].id = i;
  }
  dfs(1, 0);
  solve(1, n, 1);
  for (int i = (1), _t = (n); i <= _t; ++i) printf("%d ", Ans[i]);
  putchar('\n');
  return 0;
}
