#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;

const int MAX = 260;

int N, a[MAX][MAX], dist[MAX][MAX];
bool viz[MAX];
vector<pair<int, int> > vec;
vector<int> v;

void bfs(int node) {
    queue<int> q;

    memset(viz, 0, sizeof(viz));

    viz[node] = 1;
    for (q.push(node); !q.empty(); q.pop()) {
        int prec = q.front();

        for (int i = 1; i <= N; ++i)
            if (a[prec][i] && viz[i] == 0) {
                viz[i] = 1;
                q.push(i), dist[node][i] = max(a[prec][i], dist[node][prec]);
            }
    }
}

bool comp(const pair<int, int> &a, const pair<int, int> &b) {
    return dist[a.first][a.second] < dist[b.first][b.second];
}

int main() {
    freopen("apm.in", "r", stdin);
    freopen("apm.out", "w", stdout);

    scanf("%d", &N);
    for (int i = 1, x, y, c; i < N; ++i) {
        scanf("%d %d %d", &x, &y, &c);
        a[x][y] = a[y][x] = c;
    }

    for (int x; scanf("%d", &x) == 1; v.push_back(x));

    sort(v.begin(), v.end());
    for (int i = 1; i <= N; ++i)
        bfs(i);

    for (int i = 1; i <= N; ++i)
        for (int j = i + 1; j <= N; ++j)
            if (a[i][j] == 0)
                vec.push_back(make_pair(i, j));
    partial_sort(vec.begin(), vec.begin() + v.size(), vec.end(), comp);

    if (dist[vec[0].first][vec[0].second] > v.back()) {
        printf("0\n");
        return 0;
    }

    for (size_t i = 0, iv = 0; i < vec.size() && iv < v.size(); ++iv) {
        if (dist[vec[i].first][vec[i].second] <= v[iv]) {
            printf("%d %d %d\n", vec[i].first, vec[i].second, v[iv]);
            ++i;
        }
    }
}