#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5, P = 998244353;

int n;
vector<int> G[N];
int vis[N], dfn[N], siz[N], dfn_c, seg[N];

void dfs(int x) {
    vis[x] = 1;
    for (auto v : G[x]) if (!vis[v]) dfs(v);
}

void Dfs(int x) {
    dfn[x] = ++dfn_c;
    siz[x] = 1;
    seg[dfn_c] = x;
    for (auto v : G[x]) {
        if (!dfn[v]) Dfs(v), siz[x] += siz[v];
    }
}

struct Node {
    int ls, rs, s;
} p[N << 5];

int rt[N], tot;

void modify(int &k, int l, int r, int x) {
    int z = ++tot;
    p[z] = p[k], k = z;
    ++p[k].s;
    if (l == r) return;
    int mid = (l + r) >> 1;
    if (x <= mid) modify(p[k].ls, l, mid, x);
    else modify(p[k].rs, mid + 1, r, x);
}

int query(int k, int l, int r, int x, int y) {
    if (!k || l > y || r < x) return 0;
    if (l >= x && r <= y) return p[k].s;
    int mid = (l + r) >> 1;
    return query(p[k].ls, l, mid, x, y) + query(p[k].rs, mid + 1, r, x, y);
}

int in[N], pw[N], ipw[N], f[N];

void dfs1(int x, int L, int R) {
    if (!f[x]) f[x] = 1;
    else f[x] = 1ll * f[x] * pw[query(rt[R], 1, n, x, n) - query(rt[L - 1], 1, n, x, n)] % P;
    for (auto v : G[x]) {
        if (!f[v]) f[v] = f[x], dfs1(v, L, R);
    }
}

void dfs2(int x, int L, int R) {
    for (auto v : G[x]) {
        if (f[v]) continue;
        f[v] = f[x];
        f[v] = 1ll * f[v] * ipw[query(rt[dfn[v] + siz[v] - 1], 1, n, x, n) - query(rt[dfn[v] - 1], 1, n, x, n)] % P;
        f[v] = 1ll * f[v] * pw[query(rt[R], 1, n, v, n) - query(rt[L - 1], 1, n, v, n) - 1 - in[v]] % P;
        dfs2(v, L, R);
    }
}

signed main() {
    scanf("%d", &n);
    for (int i = 1, x, y; i <= n - 2; ++i) {
        scanf("%d%d", &x, &y);
        G[x].push_back(y), G[y].push_back(x);
    }
    dfs(1);
    vector<int> S, T;
    for (int i = 1; i <= n; ++i) {
        if (vis[i]) S.push_back(i);
        else T.push_back(i);
    }
    Dfs(S[0]), Dfs(T[0]);
    for (int i = 1; i <= n; ++i) {
        rt[i] = rt[i - 1], modify(rt[i], 1, n, seg[i]);
    }
    for (int i = 1; i <= n; ++i) {
        in[i] = query(rt[dfn[i] + siz[i] - 1], 1, n, i, n) - query(rt[dfn[i]], 1, n, i, n);
    }
    for (int i = pw[0] = 1; i <= n; ++i) pw[i] = 2ll * pw[i - 1] % P;
    for (int i = ipw[0] = 1; i <= n; ++i) ipw[i] = ((P + 1ll) / 2) * ipw[i - 1] % P;
    int res = 0, mul = 1;
    for (int i = 2; i <= n; ++i) {
        if (vis[i]) mul = 1ll * mul * pw[in[i]] % P;
    }
    if ((int)S.size() == n - 1) res = mul;
    dfs1(1, S.size() + 1, n);
    int prod = 1;
    for (int i = 1; i <= n; ++i) {
        if (!vis[i]) prod = 1ll * prod * pw[in[i]] % P;
    }
    f[T[0]] = prod;
    dfs2(T[0], S.size() + 1, n);
    int sum1 = 0, sum2 = 0;
    for (int i = 1; i <= n; ++i) {
        if (vis[i]) sum1 = (sum1 + f[i]) % P;
        else sum2 = (sum2 + f[i]) % P;
    }
    res = (res + 1ll * sum1 * sum2 % P * mul) % P;
    printf("%d\n", res);
    return 0;
}