3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (T& x : v) is >> x;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  if (!v.empty()) {
    os << v.front();
    for (int i = 1; i < v.size(); ++i) os << ' ' << v[i];
  }
  return os;
}
const int N = 200010;
int n;
int w[N], sub[N], heav[N];
vector<pair<int, int>> g[N];
bool vis[N];
int ql, qr;
int que[N], prt[N];
double tot, totDer;
double der[N];
void dfs(int u, int p, int dist, int b) {
  double v = sqrt(dist) * w[u];
  tot += v * dist;
  totDer += v;
  der[b] += v;
  for (const auto& pr : g[u])
    if (pr.first != p) dfs(pr.first, u, dist + pr.second, b);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> w[i];
  for (int rep = 1; rep < n; ++rep) {
    int u, v, w;
    cin >> u >> v >> w;
    g[u].emplace_back(v, w);
    g[v].emplace_back(u, w);
  }
  pair<double, int> ans(numeric_limits<double>::max(), -1);
  int u = 1;
  while (!vis[u]) {
    ql = qr = 0;
    que[qr++] = u;
    prt[u] = 0;
    while (ql < qr) {
      u = que[ql++];
      vis[u] = true;
      for (const auto& pr : g[u])
        if (!vis[pr.first]) {
          prt[pr.first] = u;
          que[qr++] = pr.first;
        }
    }
    for (int i = 0; i < qr; ++i) {
      vis[que[i]] = false;
      sub[que[i]] = 1;
      heav[que[i]] = 1;
    }
    int cent = que[qr - 1];
    for (int i = qr - 1; i >= 0; --i) {
      u = que[i];
      if (i) sub[prt[u]] += sub[u];
      heav[prt[u]] = max(heav[prt[u]], sub[u]);
      heav[u] = max(heav[u], qr - sub[u]);
      if (heav[u] < heav[cent]) cent = u;
    }
    vis[cent] = true;
    tot = 0;
    totDer = 0;
    u = cent;
    for (const auto& pr : g[cent]) {
      der[pr.first] = 0;
      dfs(pr.first, cent, pr.second, pr.first);
    }
    for (const auto& pr : g[cent]) {
      if (totDer - 2 * der[pr.first] < 0) {
        u = pr.first;
      }
    }
    ans = min(ans, make_pair(tot, cent));
  }
  cout.precision(10);
  cout << ans.second << ' ' << ans.first << '\n';
  return 0;
}
