#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;


const int MAX_WIDTH = 8;
double board[8][8];
vector<double> make_relations(int size) {
    vector<bool> visited(size, false);
    vector<double> relations(size);
    relations[0] = 1;
    visited[0] = true;
    queue<int> q;
    q.push(0);
    while (!q.empty()) {
        auto p = q.front();
        q.pop();
        for (int i = 0; i < size; i++) {
            if (visited[i] == false && board[p][i] > 0) {
                visited[i] = true;
                relations[i] = relations[p] * board[p][i];
                q.push(i);
            }
        }
    }
    return relations;
}

int main()
{
    //freopen("sample_input.txt", "r", stdin);
    //setbuf(stdout, NULL);
    int test_num;
    cin >> test_num;
    while (test_num--) {
        for (int i = 0; i < MAX_WIDTH; i++) {
            for (int j = 0; j < MAX_WIDTH; j++) {
                board[i][j] = 0;
            }
        }
        map<int, string> id_to_name;
        map<string, int> name_to_id;
        int trade_num;
        cin >> trade_num;
        int id = 0;
        for (int i = 0; i < trade_num; i++) {
            string name1, name2;
            double val1, val2;
            cin >> name1 >> val1 >> name2 >> val2;
            int src, target;
            if (name_to_id.count(name1) > 0) {
                src = name_to_id[name1];
            }
            else {
                src = id;
                name_to_id[name1] = id;
                id_to_name[src] = name1;
                id++;
            }
            if (name_to_id.count(name2) > 0) {
                target = name_to_id[name2];
            }
            else {
                target = id;
                name_to_id[name2] = id;
                id_to_name[target] = name2;
                id++;
            }
            board[src][target] = val2 / val1;
            board[target][src] = val1 / val2;
        }
        auto relations = make_relations(name_to_id.size());
        vector<pair<double, string>> v;
        for (int i = 0; i < relations.size(); i++) {
            v.push_back({ relations.at(i), id_to_name.at(i) });
        }
        sort(v.begin(), v.end());
        for (auto p : v)
            cout << p.second << " ";
        cout << endl;
    }

    return 0;
}

{{Ws8zXTvOvJ4h3HGk}}