#include <bits/stdc++.h>
using namespace std;
const int maxn = 1600;
struct point {
  int x, y, pos;
};
point a[maxn], Global;
int ans[maxn], cnt[maxn], n;
vector<int> g[maxn];
long long sqr(long long x) { return x * 1ll * x; }
long long vect(point p1, point p2, point p3) {
  return (p2.x - p1.x) * 1ll * (p3.y - p1.y) -
         (p3.x - p1.x) * 1ll * (p2.y - p1.y);
}
long long len(point p1, point p2) {
  return sqr(p1.x - p2.x) + sqr(p1.y - p2.y);
}
bool cmp(point p1, point p2) {
  if (vect(Global, p1, p2) > 0 ||
      (vect(Global, p1, p2) == 0 && len(Global, p1) < len(Global, p2)))
    return true;
  return false;
}
void rec(int l, int v, int p) {
  int u = l;
  for (int i = l; i < l + cnt[v]; ++i)
    if (a[i].y < a[u].y || (a[i].y == a[u].y && a[i].x < a[u].x)) u = i;
  swap(a[u], a[l]);
  Global = a[l];
  sort(a + l + 1, a + l + cnt[v], cmp);
  ans[a[l].pos] = v;
  int pref = 1, to;
  for (int i = 0; i < (int)g[v].size(); ++i) {
    to = g[v][i];
    if (to == p) continue;
    rec(l + pref, to, v);
    pref += cnt[to];
  }
  return;
}
void dfs(int v, int p) {
  cnt[v] = 1;
  int to;
  for (int i = 0; i < (int)g[v].size(); ++i) {
    to = g[v][i];
    if (to == p) continue;
    dfs(to, v);
    cnt[v] += cnt[to];
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  int u, v;
  for (int i = 1; i < n; ++i) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  for (int i = 1; i <= n; ++i) {
    cin >> a[i].x >> a[i].y;
    a[i].pos = i;
  }
  dfs(1, -1);
  rec(1, 1, -1);
  for (int i = 1; i <= n; ++i) cout << ans[i] << ' ';
  return 0;
}
