Problem: DZY loves planting, and he enjoys solving tree problems.

DZY has a weighted tree (connected undirected graph without cycles) containing n nodes (they are numbered from 1 to n). He defines the function g(x, y) (1 ≤ x, y ≤ n) as the longest edge in the shortest path between nodes x and y. Specially g(z, z) = 0 for every z.

For every integer sequence p1, p2, ..., pn (1 ≤ pi ≤ n), DZY defines f(p) as <image>. 

DZY wants to find such a sequence p that f(p) has maximum possible value. But there is one more restriction: the element j can appear in p at most xj times.

Please, find the maximum possible f(p) under the described restrictions.

Input

The first line contains an integer n (1 ≤ n ≤ 3000).

Each of the next n - 1 lines contains three integers ai, bi, ci (1 ≤ ai, bi ≤ n; 1 ≤ ci ≤ 10000), denoting an edge between ai and bi with length ci. It is guaranteed that these edges form a tree.

Each of the next n lines describes an element of sequence x. The j-th line contains an integer xj (1 ≤ xj ≤ n).

Output

Print a single integer representing the answer.

Examples

Input

4
1 2 1
2 3 2
3 4 3
1
1
1
1


Output

2


Input

4
1 2 1
2 3 2
3 4 3
4
4
4
4


Output

3

Note

In the first sample, one of the optimal p is [4, 3, 2, 1].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3005;
int N;
vector<int> adj[MAXN];
vector<int> len[MAXN];
int X[MAXN];
bool vis[MAXN];
int total = 0, nodecnt = 0, xcnt = 0;
void dfs(int node, int val) {
  vis[node] = true;
  nodecnt++;
  xcnt += X[node];
  for (int i = 0; i < adj[node].size(); i++) {
    int next = adj[node][i];
    if (!vis[next] && len[node][i] < val) dfs(next, val);
  }
}
bool check(int val) {
  memset(vis, false, sizeof(vis));
  for (int i = 0; i < N; i++)
    if (!vis[i]) {
      nodecnt = 0, xcnt = 0;
      dfs(i, val);
      if (nodecnt > total - xcnt) return false;
    }
  return true;
}
int main() {
  cin >> N;
  for (int i = 0; i < N - 1; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    a--, b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
    len[a].push_back(c);
    len[b].push_back(c);
  }
  for (int i = 0; i < N; i++) {
    cin >> X[i];
    total += X[i];
  }
  int lo = 0, hi = 10000;
  while (lo < hi) {
    int mid = lo + (hi - lo + 1) / 2;
    if (check(mid))
      lo = mid;
    else
      hi = mid - 1;
  }
  cout << lo << "\n";
  return 0;
}