#include <bits/stdc++.h>
using namespace std;

using ll = long long;

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

    int N;
    cin >> N;
    vector<int> U(N - 1), V(N - 1);
    vector graph(N, vector<int>{});
    for (int i = 0; i < N - 1; ++i) {
        cin >> U[i] >> V[i];
        U[i] -= 1;
        V[i] -= 1;
        graph[U[i]].push_back(V[i]);
        graph[V[i]].push_back(U[i]);
    }

    for (int i = 0; i < N; ++i) {
        if ((int)graph[i].size() == N - 1) {
            cout << -1 << '\n';
            return 0;
        }
    }

    const int root = U[N - 2];
    vector<int> dep(N), par(N, -1);
    auto dfs = [&](auto&& self, int u, int p) -> void {
        for (const int v : graph[u]) if (v != p) {
            dep[v] = dep[u] + 1;
            par[v] = u;
            self(self, v, u);
        }
    };
    dfs(dfs, root, -1);
    for (int i = 0; i < N - 1; ++i) {
        if (dep[U[i]] > dep[V[i]]) {
            swap(U[i], V[i]);
        }
    }
    int deepest = 0, dep1 = -1;
    for (int i = 0; i < N - 1; ++i) {
        if (dep[deepest] < dep[i]) {
            deepest = i;
        }
        if (dep[i] == 1) {
            dep1 = i;
        }
    }
    bool type = false;
    for (int u = deepest; u != root; u = par[u]) {
        if (u == V[N - 2]) {
            type = true;
        }
    }

    vector<pair<int, int>> ans;
    ans.reserve(N - 1);
    if (type) {
        for (int i = 0; i < N - 2; ++i) {
            if (dep[V[i]] == 1) {
                ans.emplace_back(deepest, V[i]);
            } else {
                ans.emplace_back(root, V[i]);
            }
        }
        ans.emplace_back(dep1, V[N - 2]);
    } else {
        for (int i = 0; i < N - 2; ++i) {
            if (dep[V[i]] == 1) {
                ans.emplace_back(V[N - 2], V[i]);
            } else {
                ans.emplace_back(root, V[i]);
            }
        }
        ans.emplace_back(deepest, V[N - 2]);
    }

    assert((int)ans.size() == N - 1);
    for (const auto& [u, v] : ans) {
        cout << u + 1 << ' ' << v + 1 << '\n';
    }

    return 0;
}