#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;

const int N = 200500, mod = 998244353;

int n, a[N], b[N], ans[N];
vector<pair<int, pair<int, int> > > g[N];
int sz[N];

void dfs1(int v, int p) {
    sz[v] = 1;
    for (auto it: g[v]) {
        int to = it.first;
        if (to == p)
            continue;
        dfs1(to, v);
        sz[v] += sz[to];
    }
}

void dfs2(int v, int p, int k) {
    int u = -1;
    for (auto it: g[v]) {
        int to = it.first;
        if (to == p)
            continue;
        if (u == -1 || sz[to] > sz[u])
            u = to;
    }
    if (u != -1)
        dfs2(u, v, k - 1);
    for (auto it: g[v]) {
        int to = it.first;
        if (to == p || to == u)
            continue;
        dfs2(to, v, k + 1);
    }
}



void solve() {
    cin >> n;

    for (int i = 0; i < n; i++) {
        g[i].clear();
    }

    for (int i = 0; i < n; i++) {
        cin >> a[i];
        b[i] = a[i];
    }
    sort(b, b + n);
    for (int i = 0; i < n; i++)
        a[i] = lower_bound(b, b + n, a[i]) - b;

    for (int i = 0; i < n - 1; i++) {
        int v, u, w;
        cin >> v >> u >> w;
        v--, u--, w--;
        g[v].push_back({u, {w, i}});
        g[u].push_back({v, {w, i}});
    }
    dfs1(0, 0);
    dfs2(0, 0, 0);
    for (int i = 0; i < n - 1; i++)
        cout << ans[i] << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--)
        solve();

    return 0;
}