#include <bits/stdc++.h>
using namespace std;
int n, ds[3001], sz[3001], ot[3001], a, b, c, no, ans, sum;
vector<pair<int, pair<int, int> > > v;
int get(int x) {
  if (ds[x] == x)
    return x;
  else
    return ds[x] = get(ds[x]);
}
void merge(int x, int y) {
  sz[x] += sz[y];
  ds[y] = x;
  ot[x] += ot[y];
  if (sz[x] > sum - ot[x]) no = 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n - 1; ++i) {
    cin >> a >> b >> c;
    v.push_back(make_pair(c, make_pair(a, b)));
  }
  sort(v.begin(), v.end());
  for (int i = 1; i <= n; ++i) {
    cin >> ot[i];
    sz[i] = 1;
    ds[i] = i;
    sum += ot[i];
  }
  for (int i = 1; i <= n; ++i)
    if (sz[i] > sum - ot[i]) no = 1;
  if (!no && n > 1) ans = v[0].first;
  for (int i = 0; i < v.size();) {
    int j = i;
    while (j < v.size() && v[i].first == v[j].first) {
      merge(get(v[j].second.first), get(v[j].second.second));
      ++j;
    }
    i = j;
    if (!no && i < v.size()) ans = v[i].first;
  }
  cout << ans << '\n';
}
