#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

template <int mod>
struct ModInt
{
    using lint = long long;
    static int get_mod() { return mod; }
    static int get_primitive_root() {
        static int primitive_root = 0;
        if (!primitive_root) {
            primitive_root = [&](){
                std::set<int> fac;
                int v = mod - 1;
                for (lint i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i;
                if (v > 1) fac.insert(v);
                for (int g = 1; g < mod; g++) {
                    bool ok = true;
                    for (auto i : fac) if (ModInt(g).power((mod - 1) / i) == 1) { ok = false; break; }
                    if (ok) return g;
                }
                return -1;
            }();
        }
        return primitive_root;
    }
    int val;
    constexpr ModInt() : val(0) {}
    constexpr ModInt &_setval(lint v) { val = (v >= mod ? v - mod : v); return *this; }
    constexpr ModInt(lint v) { _setval(v % mod + mod); }
    explicit operator bool() const { return val != 0; }
    constexpr ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); }
    constexpr ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); }
    constexpr ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); }
    constexpr ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); }
    constexpr ModInt operator-() const { return ModInt()._setval(mod - val); }
    constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }
    constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }
    constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }
    constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }
    friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); }
    friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); }
    friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); }
    friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); }
    constexpr bool operator==(const ModInt &x) const { return val == x.val; }
    constexpr bool operator!=(const ModInt &x) const { return val != x.val; }
    bool operator<(const ModInt &x) const { return val < x.val; }  // To use std::map<ModInt, T>
    friend std::istream &operator>>(std::istream &is, ModInt &x) { lint t; is >> t; x = ModInt(t); return is; }
    friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { os << x.val;  return os; }
    constexpr lint power(lint n) const {
        lint ans = 1, tmp = this->val;
        while (n) {
            if (n & 1) ans = ans * tmp % mod;
            tmp = tmp * tmp % mod;
            n /= 2;
        }
        return ans;
    }
    constexpr lint inv() const { return this->power(mod - 2); }
    constexpr ModInt operator^(lint n) const { return ModInt(this->power(n)); }
    constexpr ModInt &operator^=(lint n) { return *this = *this ^ n; }
};
using mint = ModInt<998244353>;

vector<vector<int>> to;

vector<int> D, par;
int L;
void dfs1(int now, int prv, int d)
{
    par[now] = prv;
    D[now] = d;
    for (auto nxt : to[now]) if (nxt != prv) {
        dfs1(nxt, now, d + 1);
    }
}

vector<mint> dp0, dp1, dp2;

void dfs_dp(int now, int prv) {
    dp0[now] = 1;
    dp1[now] = 0;
    dp2[now] = 0;
    bool f = false;
    for (auto nxt : to[now]) if (nxt != prv) {
        f = true;
        dfs_dp(nxt, now);
        dp2[now] = dp2[now] * (dp2[nxt] + dp1[nxt] + dp0[nxt]) + dp1[now] * (dp1[nxt] + dp2[nxt]) + dp0[now] * dp2[nxt];
        dp1[now] = dp1[now] * dp0[nxt] + dp0[now] * dp1[nxt];
        dp0[now] = dp0[now] * dp0[nxt];
    }
    dp0[now] = dp0[now] * 3 + dp1[now] * 2 + dp2[now] * 2;
    if (!f) {
        if (D[now] == L / 2) {
            dp0[now] = 2;
            dp1[now] = 1;
        }
        else dp0[now] = 3;
    }
}

vector<vector<vector<mint>>> dpv;  // (N, 3, 2)
void dfs_even(int now, int prv) {
    bool f = false;
    dpv[now][0][0] = 1;
    for (auto nxt : to[now]) if (nxt != prv) {
        f = true;
        dfs_even(nxt, now);
        vector<vector<mint>> dpnxt(3, vector<mint>(2));
        REP(np, 3) REP(nm, 2) REP(nnp, 3) REP(nnm, 2) {
            dpnxt[min(np + nnp, 2)][min(nm + nnm, 1)] += dpv[now][np][nm] * dpv[nxt][nnp][nnm];
        }
        dpv[now] = dpnxt;
    }
    if (f) {
        mint pl2 = 0, pl1 = 0, zero = 0, mi1 = 0;
        REP(np, 3) REP(nm, 2) {
            // +1
            if (np == 2) pl2 += dpv[now][np][nm];
            if (np == 1) pl1 += dpv[now][np][nm];
            if (np == 0) zero += dpv[now][np][nm];
            // +-0
            zero += dpv[now][np][nm];
            // -1
            if (nm == 1) mi1 += dpv[now][np][nm];
            if (nm == 0) zero += dpv[now][np][nm];
            dpv[now][np][nm] = 0;
        }
        dpv[now][2][0] = pl2;
        dpv[now][1][0] = pl1;
        dpv[now][0][0] = zero;
        dpv[now][0][1] = mi1;
    }
    else {
        if (D[now] == L / 2) dpv[now][1][0] = dpv[now][0][1] = dpv[now][0][0] = 1;
        else dpv[now][0][0] = 3;
    }
}

int main()
{
    int N;
    cin >> N;
    to.resize(N);
    REP(_, N - 1) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        to[a].push_back(b);
        to[b].push_back(a);
    }
    D.assign(N, 0);
    par.assign(N, -1);
    dfs1(0, -1, 0);

    int S = max_element(ALL(D)) - D.begin();
    dfs1(S, -1, 0);
    int T = max_element(ALL(D)) - D.begin();
    L = D[T];
    int R = T;
    REP(_, L / 2) R = par[R];

    if (L % 2 == 0) {
        ndarray(dpv, N, 3, 2);
        dfs1(R, -1, 0);
        for (auto A : to[R]) dfs_even(A, R);
        vector<mint> P(3);
        P[0] = 1;
        for (auto A : to[R]) {
            IREP(d, 3) {
                if (d + 1 < 3) P[d + 1] += P[d] * dpv[A][1][0];
                P[d] *= dpv[A][0][0];
            }
        }
        cout << P[2] << endl;
    }
    else {
        dp0.resize(N);
        dp1.resize(N);
        dp2.resize(N);
        int U = par[R];
        mint ret = 1;
        REP(_, 2) {
            dfs1(R, -1, 0);
            mint P0 = 1, P1 = 0;
            for (auto A : to[R]) if (A != U) {
                dfs_dp(A, R);
                P1 = P1 * dp0[A] + P0 * dp1[A];
                P0 *= dp0[A];
            }
            ret *= P1;
            swap(R, U);
        }
        cout << ret << endl;
    }
}


Measured memory_bytes: 60544