#include <bits/stdc++.h>
using namespace std;
const int N = 1500 + 5, INF = 2000 * 1000 * 1000;
vector<pair<int, int> > li[N];
vector<int> adj[N];
pair<pair<int, int>, int> po[N];
pair<int, int> J;
int d[N], out[N];
void dfs(const int &v, const int &pa) {
  d[v] = 1;
  for (int i = 0; i < (int)(adj[v]).size(); ++i) {
    if (adj[v][i] != pa) {
      dfs(adj[v][i], v);
      d[v] += d[adj[v][i]];
      li[v].push_back(make_pair(d[adj[v][i]], adj[v][i]));
    }
  }
}
bool cmp(const pair<pair<int, int>, int> &R,
         const pair<pair<int, int>, int> &T) {
  long long a1 = J.first - R.first.first, a2 = J.first - T.first.first;
  long long b1 = J.second - R.first.second, b2 = J.second - T.first.second;
  return a1 * b2 > a2 * b1;
}
void ass(int f, int s, int x) {
  pair<int, int> ans = make_pair(-INF, -INF);
  int no;
  for (int i = f; i <= s; ++i) {
    if (po[i].first.second > ans.second)
      ans = make_pair(po[i].first.first, po[i].first.second), no = i;
    else if (po[i].first.second == ans.second && po[i].first.first < ans.first)
      ans = make_pair(po[i].first.first, po[i].first.second), no = i;
  }
  J = ans;
  out[po[no].second] = x;
  swap(po[no], po[s]);
  sort(po + f, po + s, cmp);
  for (int i = 0; i < (int)(li[x]).size(); ++i) {
    ass(f, f + li[x][i].first - 1, li[x][i].second);
    f += li[x][i].first;
  }
}
int main() {
  ios::sync_with_stdio(false);
  srand(time(0));
  int n, a, b, root;
  int zero = 0;
  scanf("%d", &n);
  if (n >= 1300)
    root = 750;
  else
    root = rand() % n + 1;
  for (int i = 0; i < n - 1; ++i) {
    adj[i].reserve(N);
    li[i].reserve(N);
    scanf("%d%d", &a, &b);
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  dfs(root, zero);
  for (int i = 1; i <= n; ++i)
    scanf("%d%d", &po[i].first.first, &po[i].first.second), po[i].second = i;
  ass(1, n, root);
  for (int i = 1; i <= n; ++i) printf("%d ", out[i]);
  printf("\n");
  return 0;
}
