#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
vector<int> adj[3000];
pair<pair<int, int>, int> p[3000];
int cnt[3000], pa[3000], ans[3000];
int dfs(int u) {
  cnt[u] = 1;
  for (int i = adj[u].size(); i--;) {
    int v = adj[u][i];
    if (pa[u] == v) continue;
    pa[v] = u;
    dfs(v);
    cnt[u] += cnt[v];
  }
  return 0;
}
long long multi(int x1, int y1, int x2, int y2) {
  long long first = 1LL * x1 * y2 - 1LL * x2 * y1;
  return first;
}
pair<pair<int, int>, int> a;
bool cmp(pair<pair<int, int>, int> b, pair<pair<int, int>, int> c) {
  return multi(c.first.first - a.first.first, c.first.second - a.first.second,
               c.first.first - b.first.first,
               c.first.second - b.first.second) > 0;
}
int rdfs(int u, int st, int ed) {
  int id = p[st].second;
  a = p[st];
  ans[id] = u;
  sort(p + st + 1, p + ed + 1, cmp);
  int k = st;
  for (int i = 0; i < adj[u].size(); i++) {
    int v = adj[u][i];
    if (pa[u] == v) continue;
    rdfs(v, k + 1, k + cnt[v]);
    k += cnt[v];
  }
  return 0;
}
int main() {
  int N;
  cin >> N;
  for (int i = 1, u, v; i < N; i++) {
    scanf("%d%d", &u, &v);
    u--, v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 0; i < N; i++) {
    scanf("%d%d", &p[i].first.first, &p[i].first.second);
    p[i].second = i;
  }
  sort(p, p + N);
  int root = p[0].second;
  pa[root] = -1;
  dfs(root);
  rdfs(root, 0, N - 1);
  for (int i = 0; i < N; i++) cout << ans[i] + 1 << ' ';
  return 0;
}
