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

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define FORalld(it, a) for (__typeof((a).rbegin()) it = (a).rbegin(); it != (a).rend(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
template<class T> inline T isqrt(T k) {T r = sqrt(k) + 1; while (r * r > k) r--; return r;}
template<class T> inline T icbrt(T k) {T r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}

const int maxn = 1e5 + 5;
int n, m;
vi adj[maxn];
vii edge;
int f[maxn];
int g[maxn];
int sum[maxn];

int dj[maxn];
void init() {
    FOR(i, 0, n) dj[i] = i;
}
int find(int u) {
    return dj[u] == u ? dj[u] : dj[u] = find(dj[u]);
}
int join(int u, int v) {
    int p = find(u);
    int q = find(v);
    if (p != q) {
        dj[p] = q;
        return 1;
    }
    return 0;
}

void dfs(int u, int p, int x) {
    f[u] = x;
    sum[find(u)]++;
    for (int v : adj[u]) {
        if (v != p) {
            dfs(v, u, !x);
        }
    }
}

void solve() {
    cin >> n >> m;
    init();
    FOR(i, 0, m) {
        int u, v; cin >> u >> v; u--, v--;
        if (join(u, v)) {
            adj[u].pb(v);
            adj[v].pb(u);
        }
        else {
            edge.pb(mp(u, v));
        }
    }
    FOR(i, 0, n) if (dj[i] == i) {
        dfs(i, -1, 0);
    }
    for (pi p : edge) {
        int u = p.fi;
        int v = p.se;
        if (f[u] == f[v]) {
            g[find(u)] = 1;
        }
    }
    int tot[3] = {};
    FOR(i, 0, n) if (dj[i] == i) {
        if (sum[i] == 1) {
            tot[0]++;
        }
        else if (!g[i]) {
            tot[1]++;
        }
        else {
            tot[2]++;
        }
    }
    long long ans = 0;
    ans += (long long) tot[0] * n + (long long) (n - tot[0]) * tot[0];
    ans += (long long) tot[1] * tot[1] * 2;
    ans += (long long) tot[2] * tot[2];
    ans += (long long) tot[1] * tot[2];
    ans += (long long) tot[2] * tot[1];
    cout << ans << "\n";
}

int main() {
#ifdef _LOCAL_
    freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(0); cin.tie(0);
#endif
    solve();
    cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
    return 0;
}


Measured memory_bytes: 7668