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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        vector<vector<int>> g(n);
        vector<int> deg(n);
        for (int i = 0; i < n - 1; i++) {
            int u, v;
            cin >> u >> v;
            u--, v--;
            g[u].push_back(v);
            g[v].push_back(u);
            deg[u]++, deg[v]++;
        }

        vector<int> ord;
        int s = -1, t = -1;

        for (int i = 0; i < n; i++) {
            for (auto j : g[i]) {
                if (deg[i] != 1 && deg[j] != 1) {
                    s = i, t = j;
                    break;
                }
            }
        }

        if (s == -1 && t == -1) {
            cout << "NO\n";
            return;
        }

        cout << "YES\n";

        auto dfs = [&](auto dfs, int u, int p) -> void {
            ord.push_back(u);
            for (auto v : g[u]) {
                if (v != p) {
                    dfs(dfs, v, u);
                }
            }
        };

        dfs(dfs, s, t);
        dfs(dfs, t, s);

        for (auto i : ord) {
            cout << i + 1 << " \n"[i == ord.back()];
        }
    };
    
    solve();
    
    return 0;
}