224redfg

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<unordered_map>
#define int long long
using namespace std;
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        //cout << "---------------------------------\n";
        int n;
        cin >> n;
        vector<vector<int>>g(n);
        vector<int>in(n);
        for (int i = 0;i < n-1;i++)
        {
            int u, v, x, y;
            cin >> u >> v >> x >> y;
            v--;u--;
            if (x > y)
            {
                g[v].push_back(u);
                in[u]++;
            }
            else
            {
                g[u].push_back(v);
                in[v]++;
            }
        }
        vector<int>seq;
        queue<int>q;
        for (int i = 0;i < n;i++)
        {
            if (in[i] == 0)
                q.push(i);
        }
        while (!q.empty())
        {
            int u = q.front();
            seq.push_back(u);
            q.pop();
            for (auto v : g[u])
            {
                in[v]--;
                if (in[v] == 0)
                    q.push(v);
            }
        }
        
        vector<int>ans(n);
        for (int i = 0;i < n;i++)
        {
            ans[seq[i]] = i + 1;
        }
        for (auto e : ans)
            cout << e << " ";
        cout << "\n";
    }
    return 0;
}