Problem: You are given a tree with n vertexes and n points on a plane, no three points lie on one straight line.

Your task is to paint the given tree on a plane, using the given points as vertexes. 

That is, you should correspond each vertex of the tree to exactly one point and each point should correspond to a vertex. If two vertexes of the tree are connected by an edge, then the corresponding points should have a segment painted between them. The segments that correspond to non-adjacent edges, should not have common points. The segments that correspond to adjacent edges should have exactly one common point.

Input

The first line contains an integer n (1 ≤ n ≤ 1500) — the number of vertexes on a tree (as well as the number of chosen points on the plane).

Each of the next n - 1 lines contains two space-separated integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the numbers of tree vertexes connected by the i-th edge.

Each of the next n lines contain two space-separated integers xi and yi ( - 109 ≤ xi, yi ≤ 109) — the coordinates of the i-th point on the plane. No three points lie on one straight line.

It is guaranteed that under given constraints problem has a solution.

Output

Print n distinct space-separated integers from 1 to n: the i-th number must equal the number of the vertex to place at the i-th point (the points are numbered in the order, in which they are listed in the input).

If there are several solutions, print any of them.

Examples

Input

3
1 3
2 3
0 0
1 1
2 0


Output

1 3 2


Input

4
1 2
2 3
1 4
-1 -2
3 5
-3 3
2 0


Output

4 2 1 3

Note

The possible solutions for the sample are given below.

<image> <image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int BIT(int i, long long x) { return (x & (1 << i)); }
long long ONBIT(int i, long long x) { return (x | (1 << i)); }
long long OFFBIT(int i, long long x) { return (x & ~(1 << i)); }
long long FLIPBIT(int i, long long x) { return (x ^ (1 << i)); }
long long NUMBIT(long long x) { return __builtin_popcount(x); }
template <class T>
T gcd(T a, T b) {
  T r;
  int dem = 0;
  while (b != 0) {
    r = a % b;
    dem++;
    a = b;
    b = r;
  }
  cout << dem << endl;
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
const int maxv = 1100;
const int maxe = maxv * maxv;
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e15 + 5;
const int dr[] = {-1, 0, +1, 0};
const int dc[] = {0, +1, 0, -1};
const long double eps = 1e-9;
const char IN[] = "_.in";
const char OUT[] = "_.out";
const int maxn = 1600;
const int base = 1e9 + 7;
const double pi = 2.0 * acos(0);
int n;
struct point {
  long long x, y;
  int id;
};
vector<int> ke[maxn];
vector<point> p;
int s[maxn], res[maxn];
bool tham[maxn];
void dfs(int u, int fa) {
  s[u] = 1;
  for (__typeof(ke[u].begin()) i = ke[u].begin(); i != ke[u].end(); i++) {
    int v = *i;
    if (v != fa) {
      dfs(v, u);
      s[u] += s[v];
    }
  }
}
bool cmp(point a, point b) { return ((a.x * b.y - b.x * a.y) > 0); }
void run(int x, vector<point> p) {
  tham[x] = true;
  int m = p.size(), k = 0;
  if (m == 1) {
    res[p[0].id] = x;
    return;
  }
  for (int i = (1); i <= (m - 1); i++)
    if ((p[i].x < p[k].x) || (p[i].x == p[k].x && p[i].y < p[k].x)) k = i;
  res[p[k].id] = x;
  vector<point> q;
  for (int i = (0); i <= (m - 1); i++)
    if (i != k) q.push_back(p[i]);
  for (int i = (0); i <= (q.size() - 1); i++) {
    q[i].x -= p[k].x;
    q[i].y -= p[k].y;
  }
  sort(q.begin(), q.end(), cmp);
  int j = 0;
  for (__typeof(ke[x].begin()) i = ke[x].begin(); i != ke[x].end(); i++) {
    int y = *i;
    if (!tham[y]) {
      vector<point> nick;
      nick.clear();
      for (int kk = (j); kk <= (j + s[y] - 1); kk++) nick.push_back(q[kk]);
      j = j + s[y];
      run(y, nick);
    }
  }
}
int main() {
  cin >> n;
  int x, y;
  for (int i = (1); i <= (n - 1); i++) {
    cin >> x >> y;
    ke[x].push_back(y);
    ke[y].push_back(x);
  }
  for (int i = (1); i <= (n); i++) {
    point P;
    cin >> P.x >> P.y;
    P.id = i;
    p.push_back(P);
  }
  memset((tham), (false), sizeof(tham));
  dfs(1, 0);
  run(1, p);
  for (int i = (1); i <= (n); i++) cout << res[i] << " ";
}