#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
int a, b, c, d, e, f, g, h, i, j, k;
struct edge {
  int u, v, w;
  friend bool operator<(const edge &x, const edge &y) { return x.w < y.w; }
};
edge E[N];
int fa[N], size[N], D[N], ALL;
int Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]); }
void Init() {
  cin >> a;
  for (int ii = 1; ii < a; ii++) scanf("%d%d%d", &E[ii].u, &E[ii].v, &E[ii].w);
  sort(E + 1, E + a);
  for (int ii = 1; ii <= a; ii++) scanf("%d", &D[ii]), ALL += D[ii];
}
void Work() {
  bool ch = true;
  int an = 0;
  for (int ii = 1; ii <= a; ii++) fa[ii] = ii, size[ii] = 1;
  for (int ii = 1; ii <= a; ii++)
    if (size[ii] > ALL - D[ii]) ch = false;
  if (ch) an = E[1].w;
  for (int ii = 1; ch && ii < a - 1; ii++) {
    c = Find(E[ii].u), d = Find(E[ii].v);
    fa[d] = c, size[c] += size[d], D[c] += D[d];
    if (size[c] > ALL - D[c]) ch = false;
    if (ch) an = E[ii + 1].w;
  }
  cout << an << endl;
}
int main() {
  Init(), Work();
  return 0;
}
