#include <bits/stdc++.h>
using namespace std;
int n, x[5000], sum, fa[5000], size[5000];
struct node {
  int u, v, w;
} edge[5000];
bool cmp(node a, node b) { return a.w < b.w; }
int find(int x) {
  while (x != fa[x]) x = fa[x] = fa[fa[x]];
  return x;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) fa[i] = i, size[i] = 1;
  for (int i = 1; i < n; i++)
    scanf("%d %d %d", &edge[i].u, &edge[i].v, &edge[i].w);
  sort(edge + 1, edge + 1 + n, cmp);
  for (int i = 1; i <= n; i++) scanf("%d", &x[i]), sum += x[i];
  for (int i = 1; i <= n; i++) {
    int fx = find(edge[i].u);
    int fy = find(edge[i].v);
    if (fx == fy) continue;
    fa[fy] = fx;
    size[fx] += size[fy];
    x[fx] += x[fy];
    if (size[fx] > sum - x[fx]) {
      printf("%d\n", edge[i].w);
      return 0;
    }
  }
  printf("%d\n", edge[n - 1].w);
  return 0;
}
