#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
const int E = 3333;
int sub[E];
int u[E], v[E], w[E], root[E], first[E], sz[E], sum;
int find_root(int u) {
  if (root[u] == u) return u;
  return root[u] = find_root(root[u]);
}
void solve_A() {
  int n;
  gn(n);
  for (int i = 1; i < n; i++) gn(u[i], v[i], w[i]);
  for (int i = 1; i <= n; i++) {
    gn(first[i]);
    sum += first[i];
  }
  int st = 0, ed = 10001;
  while (st + 1 < ed) {
    int md = st + ed >> 1, flag = 1;
    for (int i = 1; i <= n; i++) root[i] = i, sz[i] = 1, sub[i] = first[i];
    for (int i = 1; i < n; i++)
      if (w[i] < md) {
        int uu = find_root(u[i]), vv = find_root(v[i]);
        if (uu == vv) continue;
        sz[uu] += sz[vv];
        root[vv] = uu;
        sub[uu] += sub[vv];
      }
    for (int i = 1; i <= n; i++)
      if (find_root(i) == i && sum < sub[i] + sz[i]) {
        flag = 0;
        break;
      }
    if (flag)
      st = md;
    else
      ed = md;
  }
  print(st);
}
int main() {
  solve_A();
  return 0;
}
