// clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using G = V<VI>;
template<class T> using WG = V<V<pair<int, T>>>;
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=0;i<(n);++i)
#define rep3(i,a,b) for(ll i=(a);i<(b);++i)
#define rep4(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i=n;i>0;--i)
#define rrep2(i,n) for(ll i=n;i>0;--i)
#define rrep3(i,a,b) for(ll i=b;i>a;--i)
#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define debug(...) print(__VA_ARGS__)
#else
#define line
#define debug
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 };
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T> inline V<T> vec(size_t a) { return V<T>(a); }
template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T> inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T> inline constexpr const T cum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r]
template<class T> inline constexpr const auto min(const T& v) { return *min_element(all(v)); }
template<class T> inline constexpr const auto max(const T& v) { return *max_element(all(v)); }
template<class T> inline V<T>& operator++(V<T>& v) { for (T& a : v)++a; return v; }
template<class T> inline V<T>& operator--(V<T>& v) { for (T& a : v)--a; return v; }
// clang-format on

#include <atcoder/modint>
using mint = atcoder::modint998244353;
int main() {
    init();

    int n;
    cin >> n;
    G g(n);
    rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    auto DP = defvec<int>(-1, n, 2);
    auto solve = [&](auto&& f, int cur, int par, bool cut) -> mint {
        if (DP[cur][cut] != -1) return DP[cur][cut];
        int& ans = DP[cur][cut];

        int m = g[cur].size();
        rep(i, m) if (g[cur][i] == par) {
            swap(g[cur][i], g[cur][m - 1]);
            g[cur].pop_back();
            break;
        }
        m = g[cur].size();
        if (m == 0) {
            if (cut) return ans = 0;
            else return ans = 1;
        }
        auto dp = vec<mint>(m, 2);
        rep(i, m) {
            int to = g[cur][i];
            dp[i][1] = f(f, to, cur, true);
            dp[i][0] = f(f, to, cur, false);
        }
        auto ldp = dp, rdp = ldp;
        rep(i, m - 1) ldp[i + 1][1] *= ldp[i][1];
        rrep(i, 0, m - 1) rdp[i - 1][1] *= rdp[i][1];
        mint res = 0;
        if (!cut) res += rdp[0][1];
        rep(i, m) {
            mint tmp = dp[i][0];
            if (i - 1 >= 0) tmp *= ldp[i - 1][1];
            if (i + 1 < m) tmp *= rdp[i + 1][1];
            res += tmp;
        }
        if (cut) {
            mint acc0 = 1, acc1 = 0;
            rep(i, m) {
                res += acc1 * dp[i][0] * (i + 1 < m ? rdp[i + 1][1] : 1);
                acc1 = acc1 * dp[i][1] + acc0 * dp[i][0];
                acc0 *= dp[i][1];
            }
        }
        ans = res.val();
        return res;
    };
    print(solve(solve, 0, -1, true).val());

    return 0;
}