#include <bits/stdc++.h>
using namespace std;
int n, hd[3003], nt[6003], nd[6003], wi[6003], t, m[3003], cnt[2][3003],
    x[3003];
void add(int u, int v, int w) {
  nt[t] = hd[u];
  nd[t] = v;
  wi[t] = w;
  hd[u] = t++;
}
bool vis[3003];
void dfs(int u, int w, int num) {
  vis[u] = 1;
  ++cnt[0][num], cnt[1][num] += x[u];
  for (int i = hd[u]; ~i; i = nt[i]) {
    if (wi[i] >= w) continue;
    int v = nd[i];
    if (vis[v]) continue;
    dfs(v, w, num);
  }
}
bool ck(int u) {
  t = 0, memset(vis, 0, sizeof vis), memset(cnt, 0, sizeof cnt);
  for (int i = 1; i <= n; ++i)
    if (!vis[i]) dfs(i, u, ++t);
  int sum = 0;
  for (int i = 1; i <= t; ++i) sum += cnt[1][i];
  for (int i = 1; i <= t; ++i)
    if (cnt[0][i] > sum - cnt[1][i]) return 0;
  return 1;
}
int main() {
  memset(hd, -1, sizeof hd);
  scanf("%d", &n);
  for (int i = 1, u, v, w; i < n; ++i) {
    scanf("%d%d%d", &u, &v, &w);
    add(u, v, w), add(v, u, w), m[i] = w;
  }
  sort(m + 1, m + n);
  for (int i = 1; i <= n; ++i) scanf("%d", &x[i]);
  int l = 0, r = n, mid;
  while (l < r - 1) {
    mid = (l + r) / 2;
    if (ck(m[mid]))
      l = mid;
    else
      r = mid;
  }
  printf("%d", m[l]);
}
