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;
inline int read() {
  int s = 0;
  char ch = getchar();
  while (!isdigit(ch)) ch = getchar();
  while (isdigit(ch)) s = s * 10 + ch - '0', ch = getchar();
  return s;
}
const int N = 2e5 + 5;
int n;
int w[N], vis[N], siz[N], mn[N];
int rt, tot;
vector<pair<int, int> > G[N];
double sum, sumd, ans = 1e20;
int p;
double d[N];
void get_siz(int u, int f) {
  siz[u] = 1;
  for (auto p : G[u]) {
    int v = p.first;
    if (v != f && !vis[v]) {
      get_siz(v, u);
      siz[u] += siz[v];
    }
  }
}
void get_rt(int u, int f) {
  int s = 0;
  for (auto p : G[u]) {
    int v = p.first;
    if (v != f && !vis[v]) {
      get_rt(v, u);
      s = max(s, siz[v]);
    }
  }
  mn[u] = max(s, tot - siz[u]);
  if (mn[u] < mn[rt]) rt = u;
}
inline void calc(int u, int fr, int f, int dep) {
  sum += dep * sqrt(dep) * w[u], sumd += sqrt(dep) * 3.0 / 2 * w[u],
      d[fr] += sqrt(dep) * 3.0 / 2 * w[u];
  for (auto p : G[u]) {
    if (p.first != f) calc(p.first, fr, u, dep + p.second);
  }
}
void dfs(int u) {
  vis[u] = 1;
  sum = sumd = 0;
  get_siz(u, 0);
  for (auto e : G[u]) {
    int v = e.first;
    d[v] = 0;
    calc(v, v, u, e.second);
  }
  if (sum < ans) ans = sum, p = u;
  for (auto e : G[u]) {
    int v = e.first;
    if (vis[v]) continue;
    if (sumd - d[v] * 2 < 0) {
      rt = 0;
      tot = siz[v];
      get_rt(v, 0);
      dfs(rt);
      break;
    }
  }
}
int main() {
  n = read();
  mn[0] = 1e9;
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1; i < n; i++) {
    int u = read(), v = read(), w = read();
    G[u].push_back({v, w});
    G[v].push_back({u, w});
  }
  get_siz(1, 0);
  tot = n, rt = 0;
  get_rt(1, 0);
  dfs(rt);
  printf("%d %.10lf", p, ans);
  return 0;
}
