/* Problem URL: https://codeforces.com/contest/2143/problem/C */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;

        V<V<tuple<int, ll, ll>>> graph(n);

        rep(i, n - 1) {
            int u, v;
            ll x, y;
            cin >> u >> v >> x >> y;

            if (u > v) {
                swap(u, v);
            }

            u--, v--;

            graph[u].emplace_back(v, x, y);
            graph[v].emplace_back(u, 0, 0);
        }

        vvi newgraph(n);

        function<void(int, int)> dfs = [&](int i, int p) {
            for (auto [j, x, y] : graph[i]) {
                if (i < j) {
                    if (x > y) {
                        newgraph[i].push_back(j);
                        continue;
                    }
                    if (y > x) {
                        newgraph[j].push_back(i);
                    }
                }

                if (j == p) {
                    continue;
                }

                dfs(j, i);
            }
        };

        dfs(0, 0);

        int now = 1;
        vi act(n);

        V<bool> vis(n);

        function<void(int)> getans = [&](int i) {
            vis[i] = true;

            for (auto j : newgraph[i]) {
                if (vis[j]) {
                    continue;
                }
                getans(j);
            }

            act[i] = now;
            now++;
        };

        rep(i, n) {
            if (vis[i]) {
                continue;
            }

            getans(i);
        }

        cout << act;
    }
}