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

const int MOD = 998244353;

vector<vector<int>> adj;
vector<bool> visited;
int s = 0;

void dfs(int u) {
    visited[u] = true;
    s++;
    for (int v : adj[u]) {
        if (!visited[v]) {
            dfs(v);
        }
    }
}

long long pow_mod(long long a, long long b) {
    long long res = 1;
    while (b) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

int main() {
    int n;
    cin >> n;
    if (n == 2) {
        cout << 2 << endl;
        return 0;
    }
    adj.resize(n + 1);
    for (int i = 0; i < n-2; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    visited.assign(n + 1, false);
    dfs(1);
    int t = n - s;

    long long bridge = (long long)s * t;
    long long within_s = (long long)s * (s - 1) / 2;
    long long within_t = (long long)t * (t - 1) / 2;
    long long m = ((long long)(s-1)*(s-2)/2) + ((long long)(t-1)*(t-2)/2);

    long long ans = (bridge + within_s + within_t) % MOD;
    ans = ans * pow_mod(2, m) % MOD;

    cout << ans << endl;
    return 0;
}