#include <bits/stdc++.h>

using namespace std;

#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<bool> VB;
typedef vector<double> VD;

const int INF = 1e9;
// const int MOD = 1e9 + 7;
const int MOD = 998244353;
const ll LINF = 1e18;
const double PI = atan(1.0) * 4.0;
const ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238

ll N, M;
VVL G(100010), groups;
VB used(100010);
VL col(100010, -1);

void dfs1(ll now, VL &g) {
    used[now] = true;
    g.emplace_back(now);
    FOREACH(to, G[now]) {
        if(used[to]) continue;
        dfs1(to, g);
    }
}

bool dfs2(ll now, ll c) {
    if(col[now] != -1) return col[now] == c;
    col[now] = c;
    bool ret = true;
    FOREACH(to, G[now]) { ret &= dfs2(to, c ^ 1); }
    return ret;
}

signed main() {
    cin >> N >> M;
    REP(i, M) {
        LCIN(u, v);
        u--, v--;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }
    REP(i, N) if(!used[i]) {
        VL g;
        dfs1(i, g);
        groups.emplace_back(g);
    }
    ll one = 0, bi = 0, notbi = 0;
    REP(i, groups.size()) {
        if(groups[i].size() == 1)
            one++;
        else {
            if(dfs2(groups[i][0], 0))
                bi++;
            else
                notbi++;
        }
    }
    ll ans = 0;
    ans += one * one;
    ans += one * (N - one);
    ans += one * (N - one);
    ans += 2 * bi * bi;
    ans += notbi * notbi;
    ans += 2 * bi * notbi;
    cout << ans << "\n";
}


Measured memory_bytes: 14968