#include <bits/stdc++.h>
using namespace std;
const int N = 2020, inF = 2e9 + 100;
int n, u, v, h[N], par[N], ans[N];
vector<int> nei[N];
vector<int> sub[N];
long double x[N], y[N], X, Y;
void solve(int v, vector<int> vec) {
  int dex = -1;
  for (int u : vec)
    if (dex == -1 ||
        pair<int, int>(x[u], y[u]) < pair<int, int>(x[dex], y[dex]))
      dex = u;
  ans[dex] = v;
  if (vec.size() == 1) return;
  X = x[dex], Y = y[dex];
  sort(vec.begin(), vec.end(), [](int a, int b) {
    return (y[a] == Y ? 0 : (y[a] - Y) / (x[a] - X)) <
           (y[b] == Y ? 0 : (y[b] - Y) / (x[b] - X));
  });
  int last = 0;
  for (int u : nei[v])
    if (u != par[v]) {
      vector<int> tosolve;
      for (int j = 0; j < sub[u].size(); j++)
        if (vec[last] == dex)
          last++, j--;
        else
          tosolve.push_back(vec[last++]);
      solve(u, tosolve);
    }
}
void dfs(int v) {
  for (int u : nei[v])
    if (u != par[v]) {
      par[u] = v;
      h[u] = h[v] + 1;
      dfs(u);
      for (int w : sub[u]) sub[v].push_back(w);
    }
  sub[v].push_back(v);
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    cin >> u >> v;
    nei[--u].push_back(--v);
    nei[v].push_back(u);
  }
  for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
  dfs(0);
  vector<int> vec(n);
  iota(vec.begin(), vec.end(), 0);
  solve(0, vec);
  for (int i = 0; i < n; i++) cout << ans[i] + 1 << ' ';
  return 0;
}
