#include <bits/stdc++.h>
using namespace std;
long long sz[2005], sx = 0, sy = 0, c[2005];
struct ppp {
  long long x, y, pos;
} p[2005];
vector<long long> edge[2005];
bool cmp(ppp a, ppp b) {
  return (a.x - sx) * (b.y - sy) - (a.y - sy) * (b.x - sx) > 0;
}
void dfs(long long u, long long fa) {
  sz[u] = 1;
  for (auto v : edge[u]) {
    if (v == fa) continue;
    dfs(v, u);
    sz[u] += sz[v];
  }
}
void solve(long long l, long long r, long long u, long long fa) {
  sx = 2e9, sy = 2e9;
  long long k = 0, pre = 0;
  for (long long i = l; i <= r; i++) {
    if (sx > p[i].x || (sx == p[i].x && sy > p[i].y)) {
      sx = p[i].x;
      sy = p[i].y;
      k = i;
    }
  }
  c[p[k].pos] = u;
  swap(p[k], p[l]);
  sort(p + l + 1, p + r + 1, cmp);
  for (auto v : edge[u]) {
    if (v == fa) continue;
    solve(l + 1 + pre, l + sz[v] + pre, v, u);
    pre += sz[v];
  }
}
int main() {
  long long n;
  cin >> n;
  for (long long i = 1; i < n; i++) {
    long long u, v;
    cin >> u >> v;
    edge[u].push_back(v);
    edge[v].push_back(u);
  }
  for (long long i = 1; i <= n; i++) {
    cin >> p[i].x >> p[i].y;
    p[i].pos = i;
  }
  dfs(1, 0);
  solve(1, n, 1, 0);
  for (int i = 1; i <= n; i++) {
    cout << c[i] << " ";
  }
  cout << endl;
}
