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>
inline bool checkMax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T, typename... Args>
inline void checkMax(T &a, const Args... arg) {
  checkMax(a, max(arg...));
}
template <class T>
inline bool checkMin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename... Args>
inline void checkMin(T &a, const Args... arg) {
  checkMin(a, min(arg...));
}
const int INF = 0x3f3f3f3f;
const long long llINF = 1e18;
const int MAXN = 2e5 + 5;
int n, rt, totsize, root;
int size[MAXN], maxpart[MAXN], a[MAXN], vis[MAXN];
double sum1, sum2, ans = llINF;
double f[MAXN];
vector<pair<int, int> > G[MAXN];
void GetRoot(int u, int fa) {
  size[u] = 1;
  maxpart[u] = 0;
  for (auto p : G[u]) {
    int v = p.first;
    if (v == fa || vis[v]) continue;
    GetRoot(v, u);
    size[u] += size[v];
    checkMax(maxpart[u], size[v]);
  }
  checkMax(maxpart[u], totsize - maxpart[u]);
  if (maxpart[u] < maxpart[rt]) rt = u;
}
void calc(int u, int fa, double &val, int dep) {
  sum1 += (double)a[u] * dep * sqrt(dep);
  sum2 += (double)a[u] * sqrt(dep) * 3 / 2;
  val += (double)a[u] * sqrt(dep) * 3 / 2;
  for (auto p : G[u]) {
    int v = p.first;
    if (v == fa || vis[v]) continue;
    calc(v, u, val, dep + p.second);
  }
}
void dfs(int u) {
  vis[u] = 1;
  sum1 = sum2 = 0;
  for (auto p : G[u]) {
    int v = p.first;
    f[v] = 0;
    calc(v, u, f[v], p.second);
  }
  if (sum1 < ans) ans = sum1, root = u;
  for (auto p : G[u]) {
    int v = p.first;
    if (vis[v]) continue;
    if (sum2 - f[v] * 2 < 0) {
      totsize = size[v];
      rt = 0;
      GetRoot(v, u);
      dfs(v);
      break;
    }
  }
}
void add_edge(int u, int v, int w) { G[u].push_back(make_pair(v, w)); }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1, u, v, w; i < n; i++) {
    scanf("%d%d%d", &u, &v, &w);
    add_edge(u, v, w);
    add_edge(v, u, w);
  }
  maxpart[0] = totsize = n;
  GetRoot(1, 0);
  dfs(rt);
  printf("%d %.10f\n", root, ans);
  return 0;
}
