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>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,no-stack-protector")
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << "\n";
  err(++it, args...);
}
function<void(void)> ____ = []() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
};
template <typename T>
vector<T> &operator<<(vector<T> &__container, T x) {
  __container.push_back(x);
  return __container;
}
template <typename T>
ostream &operator<<(ostream &out, vector<T> &__container) {
  for (T _ : __container) out << _ << ' ';
  return out;
}
void sci() {}
template <typename... Args>
void sci(int &x, Args &...args) {
  scanf("%d", &x);
  sci(args...);
}
void scl() {}
template <typename... Args>
void scl(long long int &x, Args &...args) {
  scanf("%lld", &x);
  scl(args...);
}
const int MAXN = 2e5 + 7;
double ret;
int rt;
int n, w[MAXN], root, sz[MAXN], maxsz[MAXN];
double derivative[MAXN];
bool vis[MAXN];
vector<pair<int, int> > G[MAXN];
void findroot(int u, int par, int tot) {
  sz[u] = 1;
  maxsz[u] = 0;
  for (auto &e : G[u]) {
    int v = e.first, c = e.second;
    if (vis[v] or v == par) continue;
    findroot(v, u, tot);
    sz[u] += sz[v];
    ((maxsz[u]) = (maxsz[u]) > (sz[v]) ? (maxsz[u]) : (sz[v]));
  }
  ((maxsz[u]) = (maxsz[u]) > (tot - sz[u]) ? (maxsz[u]) : (tot - sz[u]));
  if (maxsz[u] < maxsz[root]) root = u;
}
double cost;
void dfs(int u, int par, int wt) {
  cost += pow(wt, 1.5) * w[u];
  derivative[u] = w[u] * 1.5 * pow(wt, 0.5);
  for (auto &e : G[u]) {
    int v = e.first, c = e.second;
    if (v == par) continue;
    dfs(v, u, wt + c);
    derivative[u] += derivative[v];
  }
}
void divide(int u) {
  vis[u] = true;
  cost = 0;
  double sd = 0;
  for (auto &e : G[u]) {
    int v = e.first, c = e.second;
    if (vis[v]) continue;
    dfs(v, u, c);
    sd += derivative[v];
  }
  if (cost < ret) ret = cost, rt = u;
  for (auto &e : G[u]) {
    int v = e.first;
    if (sd - 2 * derivative[v] >= 0) continue;
    root = 0;
    findroot(v, u, sz[v]);
    divide(root);
  }
}
void solve() {
  sci(n);
  for (int i = 1; i <= n; i++) sci(w[i]);
  for (int i = 1; i < n; i++) {
    int u, v, c;
    sci(u, v, c);
    G[u] << pair<int, int>(v, c);
    G[v] << pair<int, int>(u, c);
  }
  ret = LLONG_MAX;
  maxsz[root = 0] = 0x3f3f3f3f;
  findroot(1, 0, n);
  divide(root);
  cout << rt << ' ' << fixed << setprecision(10) << ret << "\n";
}
int main() {
  solve();
  return 0;
}
