#include namespace { #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wunused-function" #include #pragma GCC diagnostic pop using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; using mint = modint998244353; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; VVI to(n); rep(i, n - 1) { int u, v; cin >> u >> v; u--, v--; to[u].emplace_back(v); to[v].emplace_back(u); } using A = array; auto dfs = [&](auto self, int u, int p) -> A { A res; vector rs; for(int v: to[u]) if (v != p) rs.emplace_back(self(self, v, u)); mint dp[3]; dp[0] = 1; for(auto r: rs) { rrep(i, 3) { if (i + 1 < 3) dp[i + 1] += dp[i] * r[1]; dp[i] *= r[0]; } } res[0] += dp[1] + dp[2]; res[1] += dp[0] + dp[1]; return res; }; auto r = dfs(dfs, 0, -1); cout << r[0].val() << endl; }