#include <bits/stdc++.h>
using namespace std;
int n, x, y, st, ans[111111], s[111111];
vector<int> vv[111111];
vector<pair<pair<int, int>, int> > v;
pair<double, int> o[2222][2222];
pair<pair<int, int>, int> q[111111];
void rec(int x, int p) {
  s[x] = 1;
  for (int i = 0; i < vv[x].size(); i++)
    if (vv[x][i] != p) {
      rec(vv[x][i], x);
      s[x] += s[vv[x][i]];
    }
}
void gg(int x, int p, vector<pair<pair<int, int>, int> > v) {
  sort(v.begin(), v.end());
  ans[v[0].second] = x;
  st++;
  for (int i = 1; i < v.size(); i++)
    o[st][i] = make_pair(atan2(v[i].first.second - v[0].first.second,
                               v[i].first.first - v[0].first.first),
                         i);
  sort(o[st] + 1, o[st] + v.size());
  int u = 1;
  for (int i = 0; i < vv[x].size(); i++)
    if (vv[x][i] != p) {
      vector<pair<pair<int, int>, int> > e;
      for (int j = 0; j < s[vv[x][i]]; j++)
        e.push_back(v[o[st][u].second]), u++;
      gg(vv[x][i], x, e);
    }
  st--;
}
int main() {
  cin >> n;
  for (int i = 1; i < n; i++) {
    cin >> x >> y;
    x--;
    y--;
    vv[x].push_back(y);
    vv[y].push_back(x);
  }
  rec(0, -1);
  for (int i = 0; i < n; i++)
    scanf("%d%d", &q[i].first.second, &q[i].first.first);
  for (int i = 0; i < n; i++) q[i].second = i;
  for (int i = 0; i < n; i++) v.push_back(q[i]);
  gg(0, -1, v);
  for (int i = 0; i < n; i++) cout << ans[i] + 1 << " ";
  return 0;
}
