#include <bits/stdc++.h>
inline long long read() {
  long long x = 0;
  char ch = getchar(), w = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * w;
}
void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(long long x) {
  write(x);
  puts("");
}
using namespace std;
const int N = 210000;
int n, siz[N];
vector<int> g[N];
struct T {
  int x, y, i;
  bool operator<(const T b) {
    if (x == b.x) return y < b.y;
    return x < b.x;
  }
} a[N], z;
void dfs(int x, int F) {
  siz[x] = 1;
  for (int y : g[x])
    if (y != F) {
      dfs(y, x);
      siz[x] += siz[y];
    }
}
int ans[N], p;
bool cmp(T x, T y) {
  long long x1 = x.x - z.x;
  long long y1 = x.y - z.y;
  long long x2 = y.x - z.x;
  long long y2 = y.y - z.y;
  return x1 * y2 - y1 * x2 < 0;
}
void cal(int x, int l, int r, int fa) {
  p = l;
  for (int i = l; i <= r; ++i)
    if (a[i] < a[p]) p = i;
  ans[a[p].i] = x;
  if (l == r) return;
  swap(a[p], a[l]);
  z = a[l];
  sort(a + l + 1, a + r + 1, cmp);
  int pos = l + 1;
  for (int y : g[x])
    if (y != fa) {
      cal(y, pos, pos + siz[y] - 1, x);
      pos += siz[y];
    }
}
int main() {
  n = read();
  for (int i = 1; i < n; ++i) {
    int x = read(), y = read();
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 1; i <= n; ++i) a[i].x = read(), a[i].y = read(), a[i].i = i;
  dfs(1, 0);
  cal(1, 1, n, 0);
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
  return 0;
}
