#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n;
struct edge {
  int u, v, w;
} e[N];
int fa[N], siz[N], x[N], s;
inline int findf(int x) { return fa[x] == x ? x : fa[x] = findf(fa[x]); }
inline bool cmp(const edge& a, const edge& b) { return a.w < b.w; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w);
  for (int i = 1; i <= n; i++)
    scanf("%d", &x[i]), fa[i] = i, siz[i] = 1, s += x[i];
  sort(e + 1, e + n, cmp);
  for (int i = 1; i < n; i++) {
    int fx = findf(e[i].u), fy = findf(e[i].v);
    if (fx == fy) continue;
    fa[fx] = fy, siz[fy] += siz[fx], x[fy] += x[fx];
    if (siz[fy] > s - x[fy]) {
      printf("%d", e[i].w);
      return 0;
    }
  }
  printf("0");
  return 0;
}
