#include <bits/stdc++.h>
using namespace std;
int a[3030], b[3030], c[3030], sz[3030], x[3030];
int root[3030], uu[3030];
int find(int v) {
  if (root[v] == v) return v;
  return root[v] = find(root[v]);
}
int main() {
  int n;
  cin >> n;
  int tot = 0;
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d%d", &a[i], &b[i], &c[i]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", uu + i);
    tot += uu[i];
  }
  int st = 0, ed = 100000;
  while (ed - st > 1) {
    int mid = (ed + st) / 2;
    for (int i = 1; i <= n; i++) root[i] = i, sz[i] = 1, x[i] = uu[i];
    int f = 0;
    for (int i = 0; i < n - 1; i++) {
      if (c[i] >= mid) continue;
      int u = find(a[i]), v = find(b[i]);
      if (u == v) continue;
      sz[u] += sz[v];
      root[v] = u;
      x[u] += x[v];
    }
    for (int i = 1; i <= n; i++) {
      if (find(i) == i and tot - x[i] < sz[i]) f = 1;
    }
    if (f)
      ed = mid;
    else
      st = mid;
  }
  printf("%d", st);
  return 0;
}
